REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE

DOI10.1142/S0129054107004930zbMath1149.68386MaRDI QIDQ3503088

Jurek Czyzowicz, Cédric Bastien, Wojciech Fraczak, Wojciech Rytter

Publication date: 20 May 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

concatenation state machinesstateless push-down automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Unnamed Item

This page was built for publication: REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE