PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES

DOI10.1142/S0129054102001424MaRDI QIDQ3021983zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Asynchronous systems of parallel communicating finite automata
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
• scientific article; zbMATH DE number 1502112
• scientific article; zbMATH DE number 1490952
• Reversible parallel communicating finite automata systems
• On the Computational Capacity of Parallel Communicating Finite Automata
• On the computational capacity of parallel communicating finite automata
• Parallel decision procedures for finite state automata
• scientific article; zbMATH DE number 3890738
• The parallel complexity of finite-state automata problems

Cites work

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

Cited in

(19)

• scientific article; zbMATH DE number 2106350 (Why is no real title available?)
• Reversible parallel communicating finite automata systems
• Returning and non-returning parallel communicating finite automata are equivalent
• Cellular automata: descriptional complexity and decidability
• Some undecidable problems for parallel communicating finite automata systems
• On the power of parallel communicating Watson-Crick automata systems
• Complexity of multi-head finite automata: origins and directions
• Two-party Watson-Crick computations
• On the computational capacity of parallel communicating finite automata
• Undecidability and hierarchy results for parallel communicating finite automata
• Tissue P systems.
• Non-regular unary language and parallel communicating Watson-Crick automata systems
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
• Parallel decision procedures for finite state automata
• Asynchronous systems of parallel communicating finite automata
• On the Computational Capacity of Parallel Communicating Finite Automata
• Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
• Systems of parallel communicating restarting automata
• Asynchronous parallel communicating systems of pushdown automata

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

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