TY  - JOUR
A1  - Bordihn, Henning
A1  - Holzer, Markus
A1  - Kutrib, Martin
T1  - Determination of finite automata accepting subregular languages
N2  - We investigate the descriptional complexity of the nondeterministic finite automaton (NFA) to the deterministic finite automaton (DFA) conversion problem, for automata accepting subregular languages such as combinational languages, definite languages and variants thereof, (strictly) locally testable languages, star-free languages, ordered languages, prefix-, suffix-, and infix-closed languages, and prefix-, Suffix-, and infix-free languages. Most of the bounds for the conversion problem are shown to be tight ill the exact number of states, that is, the number is sufficient and necessary in the worst case. Otherwise tight bounds in order of magnitude are shown.
Y1  - 2009
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/31590
UR  - http://www.sciencedirect.com/science/journal/03043975
SN  - 0304-3975
ER  -