Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
From MaRDI portal
Publication:620962
DOI10.1016/j.tcs.2010.10.017zbMath1206.68162OpenAlexW2041047760MaRDI QIDQ620962
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
restarting automatonparallel communicating grammar systemanalysis by reductionfinite communication complexityregular control
Cites Work
- On the synchronization in parallel communicating grammar systems
- Recent advances in formal languages and applications.
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallel communicating grammar systems with regular control and skeleton preserving FRR automata