List questions from finite-automata

Published on 23 Mar 2026 - 23:32

1k

Views

Construct DFA from context-free grammar

Published on 01 Mar 2026 - 20:47

232

Views

How to convert DFA into RE?

Published on 17 Oct 2015 - 20:47

694

Views

Trying to convert DFA to regular expression

Published on 22 Oct 2015 - 1:24

1.7k

Views

Show there is a string that's length is less than or equal to the number of states in an NFA

Published on 28 Oct 2015 - 19:57

75

Views

Does an NFA with a non-empty anf non-full language recognize a string with of length at most its number of states?

Published on 28 Oct 2015 - 23:48

270

Views

how to solve equation with epsilon

Published on 30 Oct 2015 - 15:58

16.9k

Views

Regular expression for language containing all strings that start and end with different symbols

Published on 25 Feb 2026 - 23:40

64

Views

Regular language or not : XAB where X,A belongs to (0,1)+

Published on 31 Oct 2015 - 9:10

20

Views

Are these two grammars similar?

Published on 31 Oct 2015 - 11:05

6.1k

Views

Minimum Pumping Length.

Published on 01 Nov 2015 - 23:11

840

Views

Converting NFA to DFA (exponential).

Published on 09 Nov 2015 - 6:32

399

Views

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

Published on 17 Nov 2015 - 19:14

753

Views

Determine the language accepted by this DFA (in English)

Published on 22 Nov 2015 - 10:43

515

Views

Finite Automat Machine to find binary string that contain 101

Published on 22 Nov 2015 - 12:21

List Question

For DFAs, NFAs how can you show $L(D) = \overline {L(D')}$ or $L(N) = \overline {L(N')}$?

Construct DFA from context-free grammar

How to convert DFA into RE?

Trying to convert DFA to regular expression

Show there is a string that's length is less than or equal to the number of states in an NFA

Does an NFA with a non-empty anf non-full language recognize a string with of length at most its number of states?

how to solve equation with epsilon

Regular expression for language containing all strings that start and end with different symbols

Regular language or not : XAB where X,A belongs to (0,1)+

Are these two grammars similar?

Minimum Pumping Length.

Converting NFA to DFA (exponential).

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

Determine the language accepted by this DFA (in English)

Finite Automat Machine to find binary string that contain 101

Trending Questions

Popular # Hahtags

Popular Questions