On Counter Machines versus dP Automata

DOI10.1007/978-3-642-54239-8_11zbMATH Open1407.68165OpenAlexW2149198350MaRDI QIDQ5404849

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)

Related Items (1)

Dense-choice counter machines revisited

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Dense-choice counter machines revisited 👍 👎
• Finite dP Automata versus Multi-head Finite Automata 👍 👎
• P and dP Automata: A Survey 👍 👎
• P and dP Automata: Unconventional versus Classical Automata 👍 👎
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES 👍 👎
• Deterministic Counter Machines and Parallel Matching Computations 👍 👎
• P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA 👍 👎

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)