List questions from automata

Published on 13 Nov 2022 - 21:25

86

Views

Pumping lemma for 0^f1^g2^g?

Published on 25 Mar 2026 - 21:48

77

Views

Prove $01^m2^{m+j+2}1^j$ is not a regular language.

Published on 25 Mar 2026 - 21:47

453

Views

How do I construct a DFA over the alphabet {0,1,2} that only accepts strings that have an even number of 0, 1, 2?

Published on 20 Nov 2022 - 19:37

114

Views

Find regular expression for a given language $L=\{0^{n}1^{m}\,\,\,|\,\,\,n+m(mod3)\neq0\}$

Published on 28 Mar 2026 - 15:35

72

Views

Prove that the language is not regular without using the Pumping Lemma

Published on 28 Mar 2026 - 19:29

57

Views

Determine if language is regular

Published on 28 Mar 2026 - 22:37

531

Views

Design an pushdown automata to recognize the language, L defined by, L = {wcw^c|w € {0,1}* and w^c is the one's complement of w}.

Published on 02 Dec 2022 - 7:23

70

Views

Determine if language $L=\{xyxz\,\,|\,\,x\neq\varepsilon,\,\,x,y,z\in\{0,1\}^{*}\}$ is regular

Published on 28 Mar 2026 - 15:36

49

Views

Can we prove that $L_1$ is decidable?

Published on 24 Feb 2026 - 6:47

95

Views

If $L_1L_2$ is regular language, is $L_2L_1$ regular as well?

Published on 03 Apr 2026 - 6:03

63

Views

prove $a^nb^{n^2+n}$ is not regular by intersection

Published on 25 Mar 2026 - 23:08

467

Views

Design a FA with at most 3 states that accepts all binary strings not ending in 10

Published on 22 Dec 2022 - 11:43

133

Views

Create regular expression not contain "aaa"

Published on 28 Mar 2026 - 22:37

43

Views

Understanding how to find the factors of a string

Published on 26 Dec 2022 - 23:38

List Question

Complement of $(a+b)^*aba$ intuitively

Pumping lemma for 0^f1^g2^g?

Prove $01^m2^{m+j+2}1^j$ is not a regular language.

How do I construct a DFA over the alphabet {0,1,2} that only accepts strings that have an even number of 0, 1, 2?

Find regular expression for a given language $L=\{0^{n}1^{m}\,\,\,|\,\,\,n+m(mod3)\neq0\}$

Prove that the language is not regular without using the Pumping Lemma

Determine if language is regular

Design an pushdown automata to recognize the language, L defined by, L = {wcw^c|w € {0,1}* and w^c is the one's complement of w}.

Determine if language $L=\{xyxz\,\,|\,\,x\neq\varepsilon,\,\,x,y,z\in\{0,1\}^{*}\}$ is regular

Can we prove that $L_1$ is decidable?

If $L_1L_2$ is regular language, is $L_2L_1$ regular as well?

prove $a^nb^{n^2+n}$ is not regular by intersection

Design a FA with at most 3 states that accepts all binary strings not ending in 10

Create regular expression not contain "aaa"

Understanding how to find the factors of a string

Trending Questions

Popular # Hahtags

Popular Questions