Some undecidable problems for parallel communicating finite automata systems (Q1603408)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some undecidable problems for parallel communicating finite automata systems |
scientific article; zbMATH DE number 1767242
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some undecidable problems for parallel communicating finite automata systems |
scientific article; zbMATH DE number 1767242 |
Statements
Some undecidable problems for parallel communicating finite automata systems (English)
0 references
14 July 2002
0 references
formal languages
0 references
parallel communicating finite automata systems
0 references
equivalence problem
0 references
universe problem
0 references
emptiness problem
0 references
0.96227926
0 references
0.9622792
0 references
0.91390693
0 references
0.9139069
0 references
0.9104029
0 references
0.90196806
0 references
0.8975106
0 references
0.89644355
0 references
