A characterization of definable communicating systems (Q2720916)
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: A characterization of definable communicating systems |
scientific article; zbMATH DE number 1611723
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of definable communicating systems |
scientific article; zbMATH DE number 1611723 |
Statements
2 July 2001
0 references
communicating automata
0 references
FIFO channel
0 references
progressive communication
0 references
A characterization of definable communicating systems (English)
0 references
A network of finite automata communicating with each other over FIFO channels. The network is called a definable one if a natural number \(n\) exist such that every trajectory of transitions with length \(u\) defines its final state unambignouly. It is showed that a problem of definability is unsolvable.
0 references
0.7717593908309937
0 references
0.7628603577613831
0 references
0.7615107297897339
0 references