Regularity for a large class of context-free processes is decidable

This publication has 9 references indexed in Scilit:

• Bisimulation equivalence is decidable for all context-free processes
  Published by Springer Nature ,2006
• Decidability results in automata and process theory
  Published by Springer Nature ,1996
• Deciding Regularity in Process Algebras
  BRICS Report Series, 1995
• An elementary bisimulation decision procedure for arbitrary context-free processes
  Published by Springer Nature ,1995
• Regularity of BPA-Systems is Decidable
  Published by Springer Nature ,1994
• Decidability of bisimulation equivalence for process generating context-free languages
  Journal of the ACM, 1993
• Process Algebra
  Published by Cambridge University Press (CUP) ,1990
• On the consistency of Koomen's Fair Abstraction Rule
  Theoretical Computer Science, 1987
• A variant of a recursively unsolvable problem
  Bulletin of the American Mathematical Society, 1946