Reachability sets of parameterized rings as regular languages.

Laurent Fribourg Hans Olsén

Published in: INFINITY (1997)

Keyphrases

regular languages
context free languages
grammatical inference
regular expressions
finite automata
context free grammars
state space
decision problems
context free
databases
positive data
special case
pattern matching
pac learning