Inference for regular bilanguages

DOI10.1016/0022-0000(78)90052-1MaRDI QIDQ1242698zbMATH OpenOpenAlexWikidataFDO

Authors K. Appert

Publication date 1978

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(78)90052-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3441632 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3251418 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A formal theory of inductive inference. Part II
• Automata in general algebras
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Définition et etude des Bilangages réguliers
• Language identification in the limit
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Parenthesis Grammars
• Syntactic Analysis and Operator Precedence
• Syntactic methods in pattern recognition

This page was built for publication: Inference for regular bilanguages

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