Transformation of Finite State Automata to Regular Expressions Using Henshin.
Daniel StrüberPublished in: TTC@STAF (2017)
Keyphrases
- regular expressions
- finite state automata
- regular languages
- finite state machines
- pattern matching
- finite automata
- query language
- regular path queries
- xml schema
- fixpoint
- query evaluation
- databases
- graph databases
- context free grammars
- training data
- decision problems
- information extraction
- grammatical inference
- upper bound
- special case
- learning algorithm