Some undecidable problems for parallel communicating finite automata systems (Q1603408): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127809458, #quickstatements; #temporary_batch_1722342728189 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00159-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021540835 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127809458 / rank | |||
Normal rank | |||
Latest revision as of 14:32, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some undecidable problems for parallel communicating finite automata systems |
scientific article |
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
