Question

Expressing the n-th character of a string in set notation

score 46 · Answer 1 · 2020-02-27 04:56:45

46

Views

Expressing the n-th character of a string in set notation

Published on 27 Feb 2020 - 4:56

score 63 · Answer 2 · 2020-02-28 01:26:01

63

Views

Describing the language of a given DFA

Published on 28 Feb 2020 - 1:26

score 62 · Answer 3 · 2020-02-29 16:30:00

62

Views

Is this NFA correct? First time doing this!

Published on 29 Feb 2020 - 16:30

score 1.9k · Answer 4 · 2020-02-29 21:41:36

1.9k

Views

Why is $a^nb^n$ irregular but $a^b^$ regular?

Published on 29 Feb 2020 - 21:41

score 227 · Answer 5 · 2020-03-01 19:57:23

227

Views

Is this diagram a deterministic finite automaton or non-deterministic?

Published on 01 Mar 2020 - 19:57

score 1.1k · Answer 6 · 2020-03-08 21:45:44

1.1k

Views

PDA that accepts L $\{a^i b^j c^k \mid i,j,k≥0 \text{ and } i=j \text{ or } i=k\}$

Published on 08 Mar 2020 - 21:45

score 44 · Answer 7 · 2020-03-12 15:00:11

Design a DFA for the language L = {w | w contain 2 a’s at any position and greater than 3 b’s at any position, w ϵ {a.b}*}/

score 622 · Answer 8 · 2020-03-15 17:49:27

622

Views

Cardinals of the set of all languages $L=L^*$ over $\Sigma=\{a\}$.

Published on 15 Mar 2020 - 17:49

score 43 · Answer 9 · 2020-03-18 17:04:55

43

Views

What makes a deterministic finite automaton different from another one?

Published on 18 Mar 2020 - 17:04

score 304 · Answer 10 · 2026-03-26 03:10:50

304

Views

Converting a regular expression to its complement via automata

Published on 26 Mar 2026 - 3:10

score 34 · Answer 11 · 2026-03-25 22:04:01

34

Views

Using induction to show that the languages $\mathcal L(A)$ and $\mathcal L(G(A))$ are the same

Published on 25 Mar 2026 - 22:04

score 515 · Answer 12 · 2026-02-23 06:42:25

515

Views

Prove that if L is decidable then half(L) is decidable too

Published on 23 Feb 2026 - 6:42

score 50 · Answer 13 · 2026-03-25 22:10:48

50

Views

Which symbols in the following grammar $G$ are generating?

Published on 25 Mar 2026 - 22:10

score 131 · Answer 14 · 2026-03-26 03:12:43

131

Views

What is the regular expression of the language accepted by the following NFA?

Published on 26 Mar 2026 - 3:12

score 23 · Answer 15 · 2026-03-25 23:37:06

23

Views

Which of these strings does the included pushdown automaton recognize based on accepting states?

Published on 25 Mar 2026 - 23:37

List Question

Expressing the n-th character of a string in set notation

Describing the language of a given DFA

Is this NFA correct? First time doing this!

Why is $a^nb^n$ irregular but $a^b^$ regular?

Is this diagram a deterministic finite automaton or non-deterministic?

PDA that accepts L $\{a^i b^j c^k \mid i,j,k≥0 \text{ and } i=j \text{ or } i=k\}$

Design a DFA for the language L = {w | w contain 2 a’s at any position and greater than 3 b’s at any position, w ϵ {a.b}*}/

Cardinals of the set of all languages $L=L^*$ over $\Sigma=\{a\}$.

What makes a deterministic finite automaton different from another one?

Converting a regular expression to its complement via automata

Using induction to show that the languages $\mathcal L(A)$ and $\mathcal L(G(A))$ are the same

Prove that if L is decidable then half(L) is decidable too

Which symbols in the following grammar $G$ are generating?

What is the regular expression of the language accepted by the following NFA?

Which of these strings does the included pushdown automaton recognize based on accepting states?

Trending Questions

Popular # Hahtags

Popular Questions