Decidability problems in grammar systems

DOI10.1016/S0304-3975(97)00165-5zbMath0913.68122MaRDI QIDQ1285581

Valeria Mihalache

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilityformal languagesgrammar systemscoverability tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• Parallel program schemata
• The modular grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability problems in grammar systems