NFA to DFA Transformation for Finite Languages.
Kai SalomaaSheng YuPublished in: Workshop on Implementing Automata (1996)
Keyphrases
- deterministic finite automata
- regular expressions
- finite automata
- finite state automata
- expressive power
- regular languages
- language independent
- linear transformation
- closure properties
- string matching
- intermediate representations
- simple examples
- language identification
- grammatical inference
- finite number
- cross lingual
- logic programs
- relational databases
- description languages
- data structure
- case study
- learning algorithm