Ronald's user avatar
Ronald's user avatar
Ronald's user avatar
Ronald
  • Member for 1 year, 8 months
  • Last seen more than a month ago
2 votes
1 answer
159 views

proof of non Turing-computable function g

2 votes
1 answer
74 views

minimal DFA transition function clearification

1 vote
2 answers
107 views

Optimal way to construct union automata of two DFAs

1 vote
1 answer
59 views

Are both regular expressions correct for the given DFA with three states?

1 vote
1 answer
199 views

pumping lemma length restrictions clarification

0 votes
0 answers
121 views

proof that halting problem is undecidable

0 votes
0 answers
320 views

proof that there exists a regular expression r for every NFA with only 2 states

0 votes
1 answer
602 views

Meaning of lambda-transitions in npda

0 votes
1 answer
307 views

Extended transition function in NFA

0 votes
1 answer
79 views

How to recognize all halting states of a turing machine?

0 votes
1 answer
107 views

Greibach Normal Form: Proof every sentential form is of the form xy with x terminals and y variables

0 votes
1 answer
96 views

proving a step in the proof of regular intersection

-1 votes
1 answer
47 views

Pumping lemma for context-free languages: Importance of length restriction