A note on undercover relation
From MaRDI portal
Publication:2265818
DOI10.1016/0020-0190(85)90124-3zbMath0559.68064MaRDI QIDQ2265818
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90124-3
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- On a covering relation for context-free grammars
- On the decidability of homomorphism equivalence for languages
- Test sets for context free languages and algebraic systems of equations over a free monoid
- Superdeterministic PDAs
- Associate languages and derivational complexity of formal grammars and languages