Syntactic complexity of context-free grammars over word monoids

DOI10.1007/S002360050052zbMath0855.68053OpenAlexW1963549707MaRDI QIDQ1816000

Alexander Meduna

Publication date: 21 November 1996

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050052

zbMATH Keywords

syntactic complexity of context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Uniform rewriting based on permutations

Cites Work

• Unnamed Item
• Context free derivations on word monoids

This page was built for publication: Syntactic complexity of context-free grammars over word monoids