Name
Abstract | ||
|---|---|---|
Unary deterministic one-way multi-head finite automata characterize the unary regular languages. Here they are studied with respect to the existence of head and state hierarchies. It turns out that for any fixed number of states, there is an infinite proper head hierarchy. In particular, the head hierarchy for stateless deterministic one-way multi-head finite automata is obtained using unary languages. On the other hand, it is shown that for a fixed number of heads, m+1 states are more powerful than m states. Finally, the open question of whether emptiness is undecidable for stateless one-way two-head finite automata is addressed and, as a partial answer, undecidability can be shown if at least four states are provided. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31653-1_20 | Developments in Language Theory |
Keywords | Field | DocType |
unary multi-head finite automaton,unary regular language,unary language,head hierarchy,one-way multi-head finite automaton,state hierarchy,one-way two-head finite automaton,open question,m state,infinite proper head hierarchy,fixed number | Quantum finite automata,Discrete mathematics,Combinatorics,Nested word,Unary operation,Computer science,Finite-state machine,Unary function,Regular language,Hierarchy,Undecidable problem | Conference |
Volume | ISSN | Citations |
7410 | 0302-9743 | 3 |
PageRank | References | Authors |
0.39 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Kutrib | 1 | 778 | 89.77 |
| Andreas Malcher | 2 | 204 | 39.40 |
| Matthias Wendlandt | 3 | 32 | 14.13 |