Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.
Markus LatteMatthias NiewerthPublished in: MFCS (1) (2015)
Keyphrases
- regular expressions
- monadic second order logic
- deterministic finite automata
- pattern matching
- tree automata
- finite automata
- semistructured data
- query language
- xml schema
- query containment
- fixed point
- regular languages
- finite state machines
- query evaluation
- matching algorithm
- database
- regular path queries
- data management