Name
Abstract | ||
|---|---|---|
We define compact automata and show that every language has a unique minimal compact automaton. We also define recognition of languages by compact left semitopological monoids and construct the analogue of the syntactic monoid in this context. For rational languages this reduces to the usual theory of finite automata and finite monoids. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Quantum finite automata,Discrete mathematics,Combinatorics,Automata theory,Nondeterministic finite automaton,Deterministic finite automaton,Abstract family of languages,Pure mathematics,Monoid,Syntactic monoid,Mathematics,Probabilistic automaton |
DocType | Volume | Citations |
Journal | abs/1306.1468 | 1 |
PageRank | References | Authors |
0.49 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Steinberg | 1 | 102 | 17.57 |