Question

Is it possible to design $\text{DFA}\{x,y\}$ that has at least $2$ $x$'s and at most $2$ $y$'s?

score 95 · Answer 1 · 2020-09-07 12:10:38

95

Views

Is it possible to design $\text{DFA}\{x,y\}$ that has at least $2$ $x$'s and at most $2$ $y$'s?

Published on 07 Sep 2020 - 12:10

score 121 · Answer 2 · 2020-09-07 18:06:30

121

Views

Axiomatisation of the monadic second order theory of finite linear orders.

Published on 07 Sep 2020 - 18:06

score 19 · Answer 3 · 2026-03-25 17:45:36

19

Views

Prove or disprove that the language L is regular

Published on 25 Mar 2026 - 17:45

score 280 · Answer 4 · 2026-03-26 18:04:30

280

Views

Finite State Automata

Published on 26 Mar 2026 - 18:04

score 6.8k · Answer 5 · 2026-03-28 03:33:01

6.8k

Views

Understanding Regular Expression (0 U 1)*

Published on 28 Mar 2026 - 3:33

score 275 · Answer 6 · 2026-04-02 11:26:30

275

Views

Construct an NFA wherein the first symbol of only appears once

Published on 02 Apr 2026 - 11:26

score 310 · Answer 7 · 2020-09-28 23:36:22

310

Views

How to draw this finite automate?

Published on 28 Sep 2020 - 23:36

score 71 · Answer 8 · 2020-09-29 03:07:54

71

Views

How to draw this finite automaton?

Published on 29 Sep 2020 - 3:07

score 149 · Answer 9 · 2020-09-30 22:13:21

149

Views

Is this a valid answer for this NFA to DFA conversion

Published on 30 Sep 2020 - 22:13

score 913 · Answer 10 · 2026-04-02 11:25:58

913

Views

How to prove that if the language L is regular , then K is also regular

Published on 02 Apr 2026 - 11:25

score 68 · Answer 11 · 2026-03-25 17:26:03

68

Views

How can I use the pumping lemma for context-free language in a language with two alphabets?

Published on 25 Mar 2026 - 17:26

score 26 · Answer 12 · 2026-03-29 14:07:23

26

Views

Form of strings in $\{a^nb^n | n \geq 0 \}^$ vis-a-vis $(a^nb^n)^$

Published on 29 Mar 2026 - 14:07

score 962 · Answer 13 · 2020-10-02 23:33:08

962

Views

Is it possible for a DFA to have one state with an empty alphabet?

Published on 02 Oct 2020 - 23:33

score 187 · Answer 14 · 2026-04-02 11:26:30

187

Views

How to draw the reverse automaton for this language to show that L is regular.

Published on 02 Apr 2026 - 11:26

score 1.9k · Answer 15 · 2026-03-25 11:12:37

1.9k

Views

Direct proof - DROP-OUT (A) is a regular language

Published on 25 Mar 2026 - 11:12

List Question

Is it possible to design $\text{DFA}\{x,y\}$ that has at least $2$ $x$'s and at most $2$ $y$'s?

Axiomatisation of the monadic second order theory of finite linear orders.

Prove or disprove that the language L is regular

Finite State Automata

Understanding Regular Expression (0 U 1)*

Construct an NFA wherein the first symbol of only appears once

How to draw this finite automate?

How to draw this finite automaton?

Is this a valid answer for this NFA to DFA conversion

How to prove that if the language L is regular , then K is also regular

How can I use the pumping lemma for context-free language in a language with two alphabets?

Form of strings in $\{a^nb^n | n \geq 0 \}^$ vis-a-vis $(a^nb^n)^$

Is it possible for a DFA to have one state with an empty alphabet?

How to draw the reverse automaton for this language to show that L is regular.

Direct proof - DROP-OUT (A) is a regular language

Trending Questions

Popular # Hahtags

Popular Questions