PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
DOI10.1142/S0129054102001424zbMATH Open1066.68069OpenAlexW1991766310MaRDI QIDQ3021983FDOQ3021983
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
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
multihead finite automatoncentralized and non-centralized systemsparallel communicating finite automata systemreturning and non-returning systems
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- On non-determinacy in simple computing devices
- Shuffle on trajectories: Syntactic constraints
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- k + 1 Heads Are Better than k
- Multiprocessor automata
- On two-way multihead automata
- Stack cooperation in multistack pushdown automata
Cited In (19)
- Parallel decision procedures for finite state automata
- On the Computational Capacity of Parallel Communicating Finite Automata
- Asynchronous parallel communicating systems of pushdown automata
- Tissue P systems.
- Title not available (Why is that?)
- Complexity of multi-head finite automata: origins and directions
- On the power of parallel communicating Watson-Crick automata systems
- Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
- On the computational capacity of parallel communicating finite automata
- Undecidability and hierarchy results for parallel communicating finite automata
- Cellular automata: descriptional complexity and decidability
- Returning and non-returning parallel communicating finite automata are equivalent
- Reversible parallel communicating finite automata systems
- Asynchronous systems of parallel communicating finite automata
- Some undecidable problems for parallel communicating finite automata systems
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
- Non-regular unary language and parallel communicating Watson-Crick automata systems
- Two-party Watson-Crick computations
- Systems of parallel communicating restarting 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)
