Name
Abstract | ||
|---|---|---|
We introduce the concept of finite automata over algebraic structures. We address the classical emptiness problem and its various refinements in our setting. In particular, we prove several decidability and undecidability results. We also explain the way our automata model connects with the existential first order theory of algebraic structures. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-40946-7_1 | IMPLEMENTATION AND APPLICATION OF AUTOMATA |
Field | DocType | Volume |
Quantum finite automata,Automata theory,Algebra,Computer science,Finite-state machine,Decidability,Tree automaton,Regular language,Real algebraic geometry,ω-automaton | Conference | 9705 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bakhadyr Khoussainov | 1 | 604 | 72.96 |
| Jiamou Liu | 2 | 49 | 23.19 |