On the power of P and dP automata

MaRDI QIDQ4902289zbMATH OpenFDO

Authors Rudolf Freund, Marian Kogler, Gheorghe Păun, Mario J. Pérez-Jiménez

Publication date 14 January 2013

zbMATH Keywords

Chomsky hierarchyP automatadP systemsdP automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• P and dP automata: a survey
• P and dP automata: unconventional versus classical automata
• P and dP automata: unconventional versus classical automata
• An infinite hierarchy of languages defined by dP systems
• On Counter Machines versus dP Automata

Cited in

(16)

• dP automata versus right-linear simple matrix grammars
• Variants of distributed P automata and the efficient parallelizability of languages
• P and dP automata: a survey
• An infinite hierarchy of languages defined by dP systems
• On the power of alternation in automata theory
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
• On a class ofPautomata
• Finite dP Automata versus Multi-head Finite Automata
• P and dP automata: unconventional versus classical automata
• On the classes of languages characterized by generalized P colony automata
• scientific article; zbMATH DE number 3911710 (Why is no real title available?)
• P automata revisited
• P and dP automata: unconventional versus classical automata
• On the computational complexity of P automata
• P automata with restricted power
• On Counter Machines versus dP Automata

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)