Name
Abstract | ||
|---|---|---|
Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of returning centralized systems, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. It is proved that an infinite hierarchy of language families exists, depending on the number of messages sent during their most economical recognitions. Moreover, several properties are shown to be not semi-decidable for the systems under consideration. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4204/EPTCS.151.8 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Issue |
Deterministic finite automaton,Finite-state machine,Theoretical computer science,Decidability,Hierarchy,Mathematics,Bounded function,Computation | Journal | 151 |
ISSN | Citations | PageRank |
2075-2180 | 0 | 0.34 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henning Bordihn | 1 | 167 | 31.96 |
| Martin Kutrib | 2 | 778 | 89.77 |
| Andreas Malcher | 3 | 204 | 39.40 |