Pareto grammars
From MaRDI portal
Publication:6621946
Publication date: 21 October 2024
Published in: Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Recent developments on insertion-deletion systems
- Concise description of finite languages
- Mathematical foundations of computer science 1975. 4th symposium, Mariánské Lázně, September 1--5, 1975
- On the complexity of the smallest grammar problem over fixed alphabets
- On the computational completeness of matrix simple semi-conditional grammars
- Production Complexity of Some Operations on Context-Free Languages
- Some classifications of context-free languages
This page was built for publication: Pareto grammars
