Regular language is a language which can be represented by a regular expression and thus every string in the language can be accepted by the corresponding deterministic finite automaton.
I know anbn for n > 0 is not regular by the pumping lemma but I would imagine a*b* to …
regular-language computation-theoryAccording to my textbook, the complement of L1 = A* - L1 is a regular language as long as L1 is …
computer-science discrete-mathematics regular-language formal-languagesmy string is like this sfdfdsfdsfstart112matlab2336endgfdgdfgkknfkgstart558899enddfdsfd how can we replace part of a string such a way …
regex regular-languageI have this language L = {a^n b^m c^k: m = |n - k|}. I know m = |n - …
context-free-grammar regular-language formal-languages context-free-languagePumping Lemma is used to prove a language to be not regular. But How a language can be proved to …
regular-languageI wondering if someone can suggest a good library or reference (tutorial or article) to implement a Recurrent Neural Network (…
deep-learning regular-language text-classification recurrent-neural-networkMy book gives similar but slightly different explanations of regular grammar and regular language. I doubt it's wrong, is a …
grammar regular-languageGiven L1 and L2 (irregular) context free languages - Is it possible that L1 U L2 is regular? I know …
regular-language formal-languages context-free-languageI nedd to add a-zA-ZáàâäãåçéèêëíìîïñóòôöõúùûüýÿæœÁÀÂÄÃÅÇÉÈÊËÍÌÎÏÑÓÒÔÖÕÚÙÛÜÝŸÆŒ x time but I find this very ugly. So I try \p{L} but it …
javascript regex regular-languageI've tried to look for the answer and I'm getting conflicting answers so I'm not sure. I know the reverse …
regular-language