Regularity for a large class of context-free processes is decidable
From MaRDI portal
Recommendations
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- scientific article; zbMATH DE number 4035115
- Decidability of bisimulation equivalence for process generating context-free languages
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
- On regularity of context-free languages
- scientific article; zbMATH DE number 1051237
- On decidability of regular languages theories
- scientific article; zbMATH DE number 1936756
- On decidability of theories of regular languages
Cited in
(4)
This page was built for publication: Regularity for a large class of context-free processes is decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818834)