List questions from formal-languages

Published on 18 Aug 2013 - 3:13

244

Views

Finite automata and languages question

Published on 30 Mar 2026 - 23:09

185

Views

Logic: building a sentence

Published on 23 Aug 2013 - 14:10

1k

Views

Understanding how to convert a PDA to a CFG

Published on 25 Mar 2026 - 19:03

135

Views

Connection of closed subsets of $A^{\omega}$ and deterministic Büchi-Automata, Question from Book: Infinite Word by D. Perrin & J.-E. Pin

Published on 30 Mar 2026 - 14:42

1.2k

Views

Constructing a finite automata from a subset of its language

Published on 30 Mar 2026 - 14:40

857

Views

How can a formal language $L$ concatenated with itself $L^k$ ever equal $L^{k+1}$

Published on 05 Sep 2013 - 17:11

2.9k

Views

Difference between soundness and correctness

Published on 30 Mar 2026 - 13:17

2.2k

Views

Proof of undecidability of $FINITE_{\text{TM}}$ and $USELESS_{\text{TM}}$

Published on 28 Mar 2026 - 10:24

52

Views

Is L Regular language

Published on 11 Sep 2013 - 18:09

53

Views

Proof the following - language

Published on 13 Sep 2013 - 9:02

214

Views

Type 1 grammar for all even powers of terminal character 'a'.

Published on 17 Sep 2013 - 6:18

1.5k

Views

Finite automata for any even number of a's followed by any even number of b's

Published on 31 Mar 2026 - 3:39

2.6k

Views

Kleene Star of a Set

Published on 19 Sep 2013 - 1:40

1k

Views

How do you argue (or prove) that a certain Turing machine accepts a language?

Published on 28 Mar 2026 - 10:16

List Question

Possible strings in transition diagrams for DFAs.

Finite automata and languages question

Logic: building a sentence

Understanding how to convert a PDA to a CFG

Connection of closed subsets of $A^{\omega}$ and deterministic Büchi-Automata, Question from Book: Infinite Word by D. Perrin & J.-E. Pin

Constructing a finite automata from a subset of its language

How can a formal language $L$ concatenated with itself $L^k$ ever equal $L^{k+1}$

Difference between soundness and correctness

Proof of undecidability of $FINITE_{\text{TM}}$ and $USELESS_{\text{TM}}$

Is L Regular language

Proof the following - language

Type 1 grammar for all even powers of terminal character 'a'.

Finite automata for any even number of a's followed by any even number of b's

Kleene Star of a Set

How do you argue (or prove) that a certain Turing machine accepts a language?

Trending Questions

Popular # Hahtags

Popular Questions