Decidability of DPDA equivalence

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 1-31

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Bisimulation; Decidability; DPDA; Fundamental study; Language equivalence

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; THEOREM PROVING;

STRICT DETERMINISTIC GRAMMARS;

EQUIVALENCE CLASSES;

EID: 0034910953     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00389-3     Document Type: Article

References (12)

1. Bisimulation equivalence is decidable for all context-free processes
2. Deterministic context-free languages
3. Strict deterministic grammars
4. On equivalence of grammars through transformation trees
5. Actions speak louder than words: Proving bisimilarity for context free processes
6. The equivalence problem for real-time strict deterministic languages
7. The Equivalence Problem for Deterministic Pushdown Automata is Decidable
8. L(A)=L(B)? decidability results from complete formal systems
9. Decidability of bisimulation equivalence for equational graphs of finite out-degree
10. Decidability of bisimulation equivalence for normed pushdown processes