Some undecidable problems for parallel communicating finite automata systems
type: Item
instance of: scholarly article
title: Some undecidable problems for parallel communicating finite automata systems
zbMATH Open document ID: 0996.68083
DOI: 10.1016/S0020-0190(00)00159-9
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1767242
zbMATH Keywords: formal languages
zbMATH Keywords: parallel communicating finite automata systems
zbMATH Keywords: equivalence problem
zbMATH Keywords: universe problem
zbMATH Keywords: emptiness problem
author: Carlos Martín-Vide
author: Victor Mitrana
MaRDI profile type: Publication
cites work: Multiprocessor automata
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: Q4763798
cites work: PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
cites work: Q4714446
cites work: Stack cooperation in multistack pushdown automata
cites work: On non-determinacy in simple computing devices
cites work: On two-way multihead automata
cites work: PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
cites work: Q4146255
full work available at URL: s0020-0190(00)00159-9
OpenAlex ID: W2021540835
Wikidata QID: Q127809458
Recommended article: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata
Recommended article: Undecidability and hierarchy results for parallel communicating finite automata
Recommended article: Q4503153
Recommended article: On the Computational Capacity of Parallel Communicating Finite Automata
Recommended article: On the computational capacity of parallel communicating finite automata
Recommended article: Asynchronous systems of parallel communicating finite automata
Recommended article: Q4496487
Recommended article: Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
Recommended article: PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
Recommended article: The parallel complexity of finite-state automata problems
description: scientific article; zbMATH DE number 1767242