Recommendations
Cites work
- Associate languages and derivational complexity of formal grammars and languages
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- On a covering relation for context-free grammars
- On the decidability of homomorphism equivalence for languages
- Superdeterministic PDAs
- Test sets for context free languages and algebraic systems of equations over a free monoid
This page was built for publication: A note on undercover relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265818)