A solution of the syntactical induction-inference problem for regular languages
From MaRDI portal
Publication:4139695
DOI10.1016/0096-0551(78)90006-1zbMath0364.68063WikidataQ56863737 ScholiaQ56863737MaRDI QIDQ4139695
Publication date: 1978
Published in: Computer Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-0551(78)90006-1
68Q45: Formal languages and automata
Related Items
Inference of deterministic one-counter languages, Identification of pattern languages from examples and queries, IIPS: A framework for specifying inductive-inference problems, Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms, Efficiency in the Identification in the Limit Learning Paradigm, Inferability of context-free programmed grammars