Regularity of BPA-Systems is Decidable
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bisimulation equivalence is decidable for all context-free processesPublished by Springer Nature ,2006
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Algebraic Specification of Communication ProtocolsPublished by Cambridge University Press (CUP) ,1993
- Bisimulation equivalence is decidable for basic parallel processesPublished by Springer Nature ,1993
- Process AlgebraPublished by Cambridge University Press (CUP) ,1990
- A Process Specification Formalism1Fundamenta Informaticae, 1990
- Process theory based on bisimulation semanticsPublished by Springer Nature ,1989
- Decidability of bisimulation equivalence for processes generating context-free languagesPublished by Springer Nature ,1987