Finite Automata and Unions of Regular Patterns with Bounded Constant Segments.
Antonio CanoPedro GarcíaPublished in: CIAA (2005)
Keyphrases
- finite automata
- regular patterns
- pattern languages
- regular expressions
- grammatical inference
- deterministic automata
- inductive inference
- pattern matching
- tree automata
- transactional databases
- hidden markov models
- finite automaton
- design patterns
- tree patterns
- similarity search
- query language
- positive data
- machine learning