Two-way non-deterministic finite automata with a write-once track recognize regular languages only.

Published in: DCFS (2005)

Keyphrases

regular expressions
deterministic finite automata
regular languages
context free languages
pattern matching
finite automata
query language
xml schema
matching algorithm
query evaluation
grammatical inference
active learning
machine learning
database
structured data
xml data
reinforcement learning