On Counter Machines versus dP Automata

DOI10.1007/978-3-642-54239-8_11MaRDI QIDQ5404849zbMATH OpenOpenAlexFDO

Authors Erzsébet Csuhaj-Varjú, György Vaszil

Publication date 28 March 2014

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL http://www.math.md/cmc14/CMC14_Proceedings.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Dense-choice counter machines revisited
• scientific article; zbMATH DE number 1759429
• P and dP automata: a survey
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
• scientific article; zbMATH DE number 512842
• On the power of P and dP automata
• P and dP automata: unconventional versus classical automata
• P and dP automata: unconventional versus classical automata
• Deterministic counter machines and parallel matching computations
• Finite dP Automata versus Multi-head Finite Automata

Cited in

(10)

• An infinite hierarchy of languages defined by dP systems
• Distributed processing in automata
• Dense-choice counter machines revisited
• dP automata versus right-linear simple matrix grammars
• Counter machines and distributed automata -- a story about exchanging space and time
• P and dP automata: a survey
• On the power of P and dP automata
• P and dP automata: unconventional versus classical automata
• P and dP automata: unconventional versus classical automata
• Variants of distributed P automata and the efficient parallelizability of languages

This page was built for publication: On Counter Machines versus dP Automata

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