On the multiplicity equivalence problem for context-free grammars

DOI10.1007/3-540-58131-6_50zbMath1529.68135MaRDI QIDQ6183608

Werner Kuich

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Language-theoretic problems arising from Richelieu cryptosystems
• The equivalence problem of multitape finite automata
• Closure properties of slender languages
• Thin and slender languages

This page was built for publication: On the multiplicity equivalence problem for context-free grammars