All Questions
1 question
1
vote
1
answer
147
views
Calculi for a computability class
Proving two push down automata equivalent is undecidable. But proving two finite state machines equivalent is decidable. You also cannot write a programming language that allows expressing the ...
- 459