Finite Automata, Digraph Connectivity, and Regular Expression Size.
Hermann GruberMarkus HolzerPublished in: ICALP (2) (2008)
Keyphrases
- finite automata
- regular expressions
- pattern matching
- deterministic automata
- probabilistic automata
- tree automata
- query language
- xml schema
- grammatical inference
- regular languages
- semistructured data
- string matching
- finite automaton
- databases
- computational model
- approximate matching
- hidden markov models
- database systems