More concise representation of regular languages by automata and regular expressions.
Viliam GeffertCarlo MereghettiBeatrice PalanoPublished in: Inf. Comput. (2010)
Keyphrases
- concise representation
- regular languages
- regular expressions
- finite automata
- pattern matching
- frequent itemsets
- query language
- xml schema
- matching algorithm
- query evaluation
- data model
- finite state machines
- context free grammars
- itemsets
- association rules
- regular path queries
- data sets
- database
- graph databases
- lower bound
- high level