Min of Mat is not necessarily Mat
From MaRDI portal
Publication:1606988
DOI10.1016/S0020-0190(99)00114-3zbMath0999.68099OpenAlexW2025711715MaRDI QIDQ1606988
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00114-3
Cites Work
- Unnamed Item
- A decision method for Parikh slenderness of context-free languages
- Language-theoretic problems arising from Richelieu cryptosystems
- On a conjecture about slender context-free languages
- Petri net algorithms in the theory of matrix grammars
- The set of minimal words of a context-free language is context-free
- Length considerations in context-free languages
- On lengths of words in context-free languages
- Thin and slender languages
- Simple matrix languages
This page was built for publication: Min of Mat is not necessarily Mat