Question

How to show that $ALL_{DFA}$ is in P

score 13.4k · Answer 1 · 2011-03-20 22:18:05

13.4k

Views

How to show that $ALL_{DFA}$ is in P

Published on 20 Mar 2011 - 22:18

score 108 · Answer 2 · 2026-03-28 13:21:36

108

Views

Enhancing the monoid structure over a finite alphabet to prove Arden's rule

Published on 28 Mar 2026 - 13:21

score 2k · Answer 3 · 2026-03-26 07:57:06

2k

Views

Generating all words in a language from CFG

Published on 26 Mar 2026 - 7:57

score 681 · Answer 4 · 2011-05-23 08:42:56

681

Views

Complementary language of a context free grammar

Published on 23 May 2011 - 8:42

score 1.9k · Answer 5 · 2011-05-25 02:00:35

1.9k

Views

Proving regular expressions to be equivalent

Published on 25 May 2011 - 2:00

score 3.3k · Answer 6 · 2011-06-15 14:01:55

3.3k

Views

How to compute the transition function in non-determinism finite accepter NFA?

Published on 15 Jun 2011 - 14:01

score 6.8k · Answer 7 · 2011-06-17 05:49:27

6.8k

Views

Find the DFA for the language $L = \{a^nb: n \geq 0\} \cup \{b^na : n \geq 1\}$

Published on 17 Jun 2011 - 5:49

score 8.2k · Answer 8 · 2011-06-22 19:36:56

8.2k

Views

How to prove two regular expressions are identical in mathematical way?

Published on 22 Jun 2011 - 19:36

score 2.5k · Answer 9 · 2011-06-26 11:29:20

2.5k

Views

Understanding and using the transfer-matrix-method

Published on 26 Jun 2011 - 11:29

score 85.7k · Answer 10 · 2011-08-03 08:21:21

85.7k

Views

Convert from DFA to NFA

Published on 03 Aug 2011 - 8:21

score 2.4k · Answer 11 · 2011-08-13 21:31:21

2.4k

Views

Is the language of all strings over the alphabet "a,b,c" with the same number of substrings "ab" & "ba" regular?

Published on 13 Aug 2011 - 21:31

score 168 · Answer 12 · 2011-08-15 21:19:37

168

Views

Is it possible to prove that $L$ is a regular language?

Published on 15 Aug 2011 - 21:19

score 570 · Answer 13 · 2011-08-22 01:39:26

570

Views

Question regarding the initial stack symbol in Push Down Automaton

Published on 22 Aug 2011 - 1:39

score 3k · Answer 14 · 2011-08-22 07:19:35

3k

Views

Question regarding stack operation notation in PDA

Published on 22 Aug 2011 - 7:19

score 13.5k · Answer 15 · 2011-08-23 00:19:14

13.5k

Views

Construct PDA that accepts the language $L = \{ a^nb^{n + m}c^{m}: n \geq 0, m \geq 1 \}$

Published on 23 Aug 2011 - 0:19

List Question

How to show that $ALL_{DFA}$ is in P

Enhancing the monoid structure over a finite alphabet to prove Arden's rule

Generating all words in a language from CFG

Complementary language of a context free grammar

Proving regular expressions to be equivalent

How to compute the transition function in non-determinism finite accepter NFA?

Find the DFA for the language $L = \{a^nb: n \geq 0\} \cup \{b^na : n \geq 1\}$

How to prove two regular expressions are identical in mathematical way?

Understanding and using the transfer-matrix-method

Convert from DFA to NFA

Is the language of all strings over the alphabet "a,b,c" with the same number of substrings "ab" & "ba" regular?

Is it possible to prove that $L$ is a regular language?

Question regarding the initial stack symbol in Push Down Automaton

Question regarding stack operation notation in PDA

Construct PDA that accepts the language $L = \{ a^nb^{n + m}c^{m}: n \geq 0, m \geq 1 \}$

Trending Questions

Popular # Hahtags

Popular Questions