Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids.
Kosaburo HashiguchiNaoto SakakibaraShuji JimboPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- regular expressions
- regular languages
- regular path queries
- pattern matching
- finite automata
- query language
- query containment
- context free grammars
- conjunctive regular path queries
- semistructured data
- grammatical inference
- context free
- query evaluation
- expressive power
- tree automata
- deterministic finite automata
- xml schema
- databases
- matching algorithm
- building blocks
- database systems