Name
Abstract | ||
|---|---|---|
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem's and positivity problems. We also introduce the concept of linear recurrence automata in order to show the connection naturally. Then, we also give possible generalizations of linear recurrence relations and automata on vectors. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.22364/bjmc.2016.4.4.22 | BALTIC JOURNAL OF MODERN COMPUTING |
Keywords | Field | DocType |
emptiness problem,unary alphabet,probabilistic and quantum automata,Skolem's problem,positivity problem | Quantum finite automata,Discrete mathematics,Combinatorics,Decision problem,Automata theory,Unary operation,Probabilistic logic,Probabilistic automaton,Mathematics,ω-automaton,Undecidable problem | Journal |
Volume | Issue | ISSN |
4 | 4 | 2255-8942 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mika Hirvensalo | 1 | 163 | 21.19 |
| Abuzer Yakaryilmaz | 2 | 168 | 25.31 |