Learning deterministic regular grammars from stochastic samples in polynomial time - Carrasco, Rafael C.; Oncina, Jose (RAIRO. Informatique théorique et applications, 1999)
Keywords: Applied sciences; Automata. Abstract machines. Turing machines; Computer science; control theory; systems; Exact sciences and technology; Language theory and syntactical analysis; Theoretical computing; Formal language; Finite automaton; Identification; Grammar; Stochastic language; Stochastic grammar; Algorithm; Convergence; Learning; Regular grammar; Computer program; Stochastic deterministic regular language; Stochastic automaton; Regularity; Deterministic language