Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

DOI10.1016/J.TCS.2010.10.017zbMATH Open1206.68162OpenAlexW2041047760MaRDI QIDQ620962FDOQ620962

Friedrich Otto, Martin Plátek, Dana Pardubská

Publication date: 2 February 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.017

zbMATH Keywords

restarting automatonparallel communicating grammar systemanalysis by reductionfinite communication complexityregular control

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent advances in formal languages and applications.
• On the synchronization in parallel communicating grammar systems
• A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
• On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
• Parallel Communicating Grammar Systems with Regular Control
• Two lower bounds on distributive generation of languages
• Regular canonical systems

Cited In (1)

• Parallel Communicating Grammar Systems with Regular Control

This page was built for publication: Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

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