State Complexity of NFA to DFA Conversion of Subregular Language Families.

Henning Bordihn Markus Holzer Martin Kutrib

Published in: DCFS (2008)

Keyphrases

deterministic finite automata
regular expressions
real time
memory requirements
databases
information retrieval
similarity measure
natural language
computational complexity
worst case
general purpose
programming language
language learning
complexity analysis