PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES

DOI10.1142/S0129054102001424zbMath1066.68069OpenAlexW1991766310MaRDI QIDQ3021983

Victor Mitrana, Alexandru Mateescu, Carlos Martín-Vide

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001424

zbMATH Keywords

multihead finite automatoncentralized and non-centralized systemsparallel communicating finite automata systemreturning and non-returning systems

Mathematics Subject Classification ID

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

Related Items

UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA ⋮ ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA ⋮ Non-regular unary language and parallel communicating Watson-Crick automata systems ⋮ Asynchronous Parallel Communicating Systems of Pushdown Automata ⋮ Complexity of multi-head finite automata: origins and directions ⋮ Tissue P systems. ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ On the Computational Capacity of Parallel Communicating Finite Automata ⋮ Returning and non-returning parallel communicating finite automata are equivalent ⋮ On the power of parallel communicating Watson-Crick automata systems ⋮ Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities ⋮ Reversible parallel communicating finite automata systems ⋮ Two-Party Watson-Crick Computations ⋮ Some undecidable problems for parallel communicating finite automata systems

Cites Work

• Multiprocessor automata
• Shuffle on trajectories: Syntactic constraints
• A note on semilinear sets and bounded-reversal multihead pushdown automata
• Stack cooperation in multistack pushdown automata
• On non-determinacy in simple computing devices
• On two-way multihead automata
• k + 1 Heads Are Better than k
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

This page was built for publication: PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES