Login / Signup
On the Acceptance Power of Regular Languages.
Bernd Borchert
Published in:
Theor. Comput. Sci. (1995)
Keyphrases
</>
regular languages
context free languages
regular expressions
grammatical inference
finite automata
decision problems
finite state machines
pac learning
context free grammars
context free
positive data
databases
pattern matching
theoretical analysis
upper bound
special case
database systems