Question

Creating "Zigzag" context-free grammar of $2$ languages with the same letters

score 41 · Answer 1 · 2026-03-26 17:14:04

41

Views

Creating "Zigzag" context-free grammar of $2$ languages with the same letters

Published on 26 Mar 2026 - 17:14

score 1.1k · Answer 2 · 2026-03-27 02:06:49

1.1k

Views

Prove that if L is a recursive language, then its complement Ls is also recursive

Published on 27 Mar 2026 - 2:06

score 51 · Answer 3 · 2023-06-02 07:48:59

51

Views

Let be a regular language. Prove all minimal automata for the language are isomorphic

Published on 02 Jun 2023 - 7:48

score 48 · Answer 4 · 2026-03-25 10:55:29

48

Views

Find the mistakes(pumping lemma proof). Can you help me?

Published on 25 Mar 2026 - 10:55

score 75 · Answer 5 · 2026-03-26 14:18:39

75

Views

Are $111^$ and $11^1$ equivalent?

Published on 26 Mar 2026 - 14:18

score 1.1k · Answer 6 · 2026-03-27 02:02:53

1.1k

Views

Does the set of all programs form a group that acts on machine state (essentially, i.e. with a few exceptions)?

Published on 27 Mar 2026 - 2:02

score 37 · Answer 7 · 2026-03-27 03:44:31

37

Views

Let $H ≤ F_A$ be finitely generated and $g \in F_A$. Show that it is decidable if $xgx^{-1} \in H$ for some $x \in F_A$

Published on 27 Mar 2026 - 3:44

score 69 · Answer 8 · 2026-02-23 04:41:43

69

Views

Can substrings of a regular language always be recognized by an "isolated" path in some finite state automaton?

Published on 23 Feb 2026 - 4:41

score 29 · Answer 9 · 2026-03-25 10:57:21

29

Views

I want to prove the pumping lemma for context-free languages but instead of using Chomsky's form using a new form.

Published on 25 Mar 2026 - 10:57

score 655 · Answer 10 · 2023-06-24 14:38:48

655

Views

Construct an NFA over alphabet {, } that accepts all words with more a’s modulo 4 than b’s modulo 3.

Published on 24 Jun 2023 - 14:38

score 36 · Answer 11 · 2023-06-25 14:54:03

36

Views

Let $L \subseteq \{a,b \}^* $ be a rational language. Show that $K$ is rational.

Published on 25 Jun 2023 - 14:54

score 72 · Answer 12 · 2026-03-26 17:52:53

72

Views

Why do we care if a power series has roots

Published on 26 Mar 2026 - 17:52

score 49 · Answer 13 · 2026-02-23 12:02:54

49

Views

Infinite Recursion as the Intuitive Foundation for the Halting Undecidability Proof

Published on 23 Feb 2026 - 12:02

score 163 · Answer 14 · 2023-08-26 02:46:02

163

Views

Design a finite state machine that performs the serial addition of three arbitrary binary numbers

Published on 26 Aug 2023 - 2:46

score 47 · Answer 15 · 2023-08-28 18:55:48

47

Views

Describing grammar language / which language does this automaton recognize

Published on 28 Aug 2023 - 18:55

List Question

Creating "Zigzag" context-free grammar of $2$ languages with the same letters

Prove that if L is a recursive language, then its complement Ls is also recursive

Let be a regular language. Prove all minimal automata for the language are isomorphic

Find the mistakes(pumping lemma proof). Can you help me?

Are $111^$ and $11^1$ equivalent?

Does the set of all programs form a group that acts on machine state (essentially, i.e. with a few exceptions)?

Let $H ≤ F_A$ be finitely generated and $g \in F_A$. Show that it is decidable if $xgx^{-1} \in H$ for some $x \in F_A$

Can substrings of a regular language always be recognized by an "isolated" path in some finite state automaton?

I want to prove the pumping lemma for context-free languages but instead of using Chomsky's form using a new form.

Construct an NFA over alphabet {, } that accepts all words with more a’s modulo 4 than b’s modulo 3.

Let $L \subseteq \{a,b \}^* $ be a rational language. Show that $K$ is rational.

Why do we care if a power series has roots

Infinite Recursion as the Intuitive Foundation for the Halting Undecidability Proof

Design a finite state machine that performs the serial addition of three arbitrary binary numbers

Describing grammar language / which language does this automaton recognize

Trending Questions

Popular # Hahtags

Popular Questions