Question

DFA accepts only one state

score 976 · Answer 1 · 2018-07-25 16:54:04

976

Views

DFA accepts only one state

Published on 25 Jul 2018 - 16:54

score 1.2k · Answer 2 · 2018-08-01 10:59:41

1.2k

Views

equivalence of finite state and regular expression

Published on 01 Aug 2018 - 10:59

score 145 · Answer 3 · 2026-03-24 23:48:13

145

Views

Construct a grammar that generates the language $L = \{ a^x b^{x-y} c^y \mid x > y > 0 \text{ and } (x + y) \text{ is even }\}$

Published on 24 Mar 2026 - 23:48

score 35 · Answer 4 · 2018-08-08 11:42:39

35

Views

Is a minimal image of an automaton a F-clique?

Published on 08 Aug 2018 - 11:42

score 146 · Answer 5 · 2026-03-25 01:22:28

146

Views

Convert Context-Free Grammar to Automata

Published on 25 Mar 2026 - 1:22

score 45 · Answer 6 · 2026-03-25 01:18:20

45

Views

Define a grammar from the alphabet $\{ a, b \}$ which accepts the string $w$ where $\#_{w(b)} \leq \#_{w(a)} \leq 2 \#_{w(b)}$

Published on 25 Mar 2026 - 1:18

score 222 · Answer 7 · 2018-08-27 23:59:47

222

Views

Given a finite automaton determine if it is deterministic and indicate regular expression

Published on 27 Aug 2018 - 23:59

score 612 · Answer 8 · 2018-08-28 01:23:43

612

Views

Finite automata where the difference in the number of a's and b's is less than three

Published on 28 Aug 2018 - 1:23

score 436 · Answer 9 · 2018-08-30 14:46:54

436

Views

Is it ALWAYS true that if L= {w|odd(w) is regular} then L is regular.

Published on 30 Aug 2018 - 14:46

score 1.4k · Answer 10 · 2018-09-01 13:43:57

1.4k

Views

Conversion of Epsilon NFA to DFA

Published on 01 Sep 2018 - 13:43

score 58 · Answer 11 · 2026-03-24 23:41:08

58

Views

Equivalent grammar

Published on 24 Mar 2026 - 23:41

score 47 · Answer 12 · 2026-02-23 01:20:04

47

Views

Decidability context-sensitiv and context-free grammars

Published on 23 Feb 2026 - 1:20

score 286 · Answer 13 · 2026-03-25 01:23:45

286

Views

Simply starred language. $\left\{(ab)^n:n\in\mathbb{N}\right\}$ it is regular?

Published on 25 Mar 2026 - 1:23

score 63 · Answer 14 · 2026-03-25 04:37:23

63

Views

String powers. Lemma 1.3.5 in word processing in groups. Epstein.

Published on 25 Mar 2026 - 4:37

score 381 · Answer 15 · 2018-09-20 13:14:39

381

Views

Converting NFA to DFA. Loops and exits.

Published on 20 Sep 2018 - 13:14

List Question

DFA accepts only one state

equivalence of finite state and regular expression

Construct a grammar that generates the language $L = \{ a^x b^{x-y} c^y \mid x > y > 0 \text{ and } (x + y) \text{ is even }\}$

Is a minimal image of an automaton a F-clique?

Convert Context-Free Grammar to Automata

Define a grammar from the alphabet $\{ a, b \}$ which accepts the string $w$ where $\#_{w(b)} \leq \#_{w(a)} \leq 2 \#_{w(b)}$

Given a finite automaton determine if it is deterministic and indicate regular expression

Finite automata where the difference in the number of a's and b's is less than three

Is it ALWAYS true that if L= {w|odd(w) is regular} then L is regular.

Conversion of Epsilon NFA to DFA

Equivalent grammar

Decidability context-sensitiv and context-free grammars

Simply starred language. $\left\{(ab)^n:n\in\mathbb{N}\right\}$ it is regular?

String powers. Lemma 1.3.5 in word processing in groups. Epstein.

Converting NFA to DFA. Loops and exits.

Trending Questions

Popular # Hahtags

Popular Questions