On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

DOI10.1007/978-3-642-00982-2_56MaRDI QIDQ3618620zbMATH OpenOpenAlexFDO

Authors Dana Pardubská, Martin Plátek, Friedrich Otto

Publication date 2 April 2009

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00982-2_56

Mathematics Subject Classification ID

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

Recommendations

• Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
• Parallel Communicating Grammar Systems with Regular Control
• scientific article; zbMATH DE number 8777
• scientific article; zbMATH DE number 878943
• Correctness Preservation and Complexity of Simple RL-Automata

Cites work

• scientific article; zbMATH DE number 745858 (Why is no real title available?)
• On determinism versus nondeterminism for restarting automata
• The computational complexity of PCGS with regular components

Cited in

(2)

• scientific article; zbMATH DE number 1406173 (Why is no real title available?)
• Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

This page was built for publication: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618620)