A solution of the syntactical induction-inference problem for regular languages

DOI10.1016/0096-0551(78)90006-1MaRDI QIDQ4139695zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tsyh-Wen Pao, John W. Carr

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(6)

• 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
• Inference of deterministic one-counter languages

This page was built for publication: A solution of the syntactical induction-inference problem for regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139695)