On the inference of stochastic regular grammars

DOI10.1016/S0019-9958(78)90106-7zbMath0387.68070OpenAlexW2054379634MaRDI QIDQ4168101

Adrian Walker, A. van der Mude

Publication date: 1978

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(78)90106-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Learning deterministic regular grammars from stochastic samples in polynomial time ⋮ `Ideal learning' of natural language: positive results about learning from positive evidence ⋮ Abductive learning of quantized stochastic processes with probabilistic finite automata ⋮ Accurate computation of the relative entropy between stochastic regular grammars ⋮ Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms

This page was built for publication: On the inference of stochastic regular grammars