A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages.

Pál Dömösi Satoshi Okawa

Published in: Acta Cybern. (2001)

Keyphrases

context free languages
regular languages
context free
context free grammars
grammatical inference
regular expressions
finite automata
inductive inference
positive data
context sensitive
context dependent
decision problems
data model
matching algorithm
finite state machines