Unambiguous finite automaton
Semantic Scholar uses AI to extract papers important to this topic.
Unambiguous automata, i.e., nondeterministic automata with the restriction of having at most one accepting run over a word, have… (More)
Unambiguous automata are usually seen as a natural class of automata in-between deterministic and nondeterministic ones. We show… (More)
Tree automata operating on unranked trees use regular languages, called horizontal languages, to define the transitions of the… (More)
Nondeterministic finite automata (NFA) with at most one accepting computation on every input string are known as unambiguous… (More)
In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of… (More)
The goal of this paper is to study the exact complexity of several important problems concerning finite-state automata and to… (More)