Grammatical inference for even linear languages based on control sets

DOI10.1016/0020-0190(88)90208-6zbMath0658.68094MaRDI QIDQ1111403

Yuji Takada

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90208-6

zbMATH Keywords

grammatical inference; regular sets; control sets; even linear languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Learning two-tape automata from queries and counterexamples, Input–output identification of controlled discrete manufacturing systems, The grammatical inference problem for the Szilard languages of linear grammars, Learning efficiency of very simple grammars from positive data, A McCulloch-Pitts neural net to characterize even linear languages, Recent advances of grammatical inference, Learning deterministic even linear languages from positive examples, Even linear simple matrix languages: formal language properties and grammatical inference., A comparative analysis of recent identification approaches for discrete-event systems, LARS: a learning algorithm for rewriting systems, Learning Efficiency of Very Simple Grammars from Positive Data

Cites Work

• Unnamed Item
• Learning regular sets from queries and counterexamples
• Inference of even linear grammars and its application to picture description languages
• On a family of linear grammars
• Control sets on grammars