P and dP automata: unconventional versus classical automata
From MaRDI portal
Publication:3167478
DOI10.1007/978-3-642-31653-1_2zbMATH Open1358.68165OpenAlexW201862490MaRDI QIDQ3167478FDOQ3167478
Authors: Erzsébet Csuhaj-Varjú
Publication date: 2 November 2012
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_2
Recommendations
Cited In (10)
- Membrane automata for modeling biomolecular processes
- dP automata versus right-linear simple matrix grammars
- P and dP automata: a survey
- On the power of P and dP automata
- P automata: concepts, results, and new aspects
- P and dP automata: unconventional versus classical automata
- P automata revisited
- Hierarchical automata and P-systems
- Variants of distributed P automata and the efficient parallelizability of languages
- On Counter Machines versus dP Automata
This page was built for publication: P and dP automata: unconventional versus classical automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167478)