On the power of P and dP automata
From MaRDI portal
Publication:4902289
zbMATH Open1265.68076MaRDI QIDQ4902289FDOQ4902289
Authors: Rudolf Freund, Marian Kogler, Gheorghe Păun, Mario J. Pérez-Jiménez 
Publication date: 14 January 2013
Recommendations
Cited In (15)
- Finite dP Automata versus Multi-head Finite Automata
- On a class ofPautomata
- An infinite hierarchy of languages defined by dP systems
- On the computational complexity of P automata
- Title not available (Why is that?)
- dP automata versus right-linear simple matrix grammars
- P and dP automata: a survey
- P automata revisited
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
- P and dP automata: unconventional versus classical automata
- Variants of distributed P automata and the efficient parallelizability of languages
- On the classes of languages characterized by generalized P colony automata
- On Counter Machines versus dP Automata
- On the power of alternation in automata theory
- P automata with restricted power
This page was built for publication: On the power of P and dP automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902289)
