Name
Abstract | ||
|---|---|---|
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These results are then used in order to establish normal forms (in the sense of [4]) not only for finite automata, but also for infinite automata, as long as they are compact. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4204/EPTCS.140.1 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Volume |
Discrete mathematics,Quantum finite automata,Combinatorics,Lattice (order),Automaton,Compact space,Finite-state machine,Probabilistic automaton,Mathematics | Journal | 140 |
Issue | ISSN | Citations |
140 | 2075-2180 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johann Schuster | 1 | 28 | 3.69 |
| Markus Siegle | 2 | 376 | 32.29 |