On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata.
Richard Edwin StearnsHarry B. Hunt IIIPublished in: SIAM J. Comput. (1985)
Keyphrases
- finite automata
- regular expressions
- regular languages
- grammatical inference
- regular path queries
- tree automata
- pattern matching
- query containment
- query evaluation
- decision problems
- query language
- context free grammars
- semistructured data
- matching algorithm
- context free
- xml schema
- deterministic finite automata
- computational biology
- knowledge base
- finite automaton