Inference for regular bilanguages

DOI10.1016/0022-0000(78)90052-1zbMath0368.68075OpenAlexW2064625619WikidataQ111465613 ScholiaQ111465613MaRDI QIDQ1242698

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Syntactic methods in pattern recognition
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Syntactic Analysis and Operator Precedence
• Parenthesis Grammars
• Automata in general algebras
• Définition et etude des Bilangages réguliers
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Language identification in the limit
• A formal theory of inductive inference. Part II

This page was built for publication: Inference for regular bilanguages