EUDML | Learning deterministic regular grammars from stochastic samples in polynomial time

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Learning deterministic regular grammars from stochastic samples in polynomial time”

Some remarks on the extension of a finite set of stochastic automata

S. Janicki, D. Szynal (1975)

Applicationes Mathematicae

Similarity:

Theory of stochastic automata

Peter H. Starke (1966)

Kybernetika

Similarity: