Grammatical inference for even linear languages based on control sets

DOI10.1016/0020-0190(88)90208-6MaRDI QIDQ1111403zbMATH OpenOpenAlexFDO

Authors 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 inferenceregular setscontrol setseven linear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4096798
• scientific article; zbMATH DE number 845930
• Control sets on grammars
• The grammatical inference problem for the Szilard languages of linear grammars
• Inference of even linear grammars and its application to picture description languages
• A grammatical inference for harmonic linear languages
• scientific article; zbMATH DE number 4153899
• scientific article; zbMATH DE number 2089362
• Controlled pure grammar systems
• A general framework for sequential grammars with control mechanisms

Cites work

• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Control sets on grammars
• Inference of even linear grammars and its application to picture description languages
• Learning regular sets from queries and counterexamples
• On a family of linear grammars

Cited in

(21)

• Input-output identification of controlled discrete manufacturing systems
• A grammatical inference for harmonic linear languages
• Reducing control alphabet size for the control of right linear grammars with unknown behaviors
• Relations between Control Mechanisms for Sequential Grammars1
• Language learning from membership queries and characteristic examples
• Learning efficiency of very simple grammars from positive data
• scientific article; zbMATH DE number 845930 (Why is no real title available?)
• The grammatical inference problem for the Szilard languages of linear grammars
• Two-Sided Strictly Locally Testable Languages
• Learning deterministic even linear languages from positive examples
• Recent advances of grammatical inference
• A comparative analysis of recent identification approaches for discrete-event systems
• Grammatical inference: An old and new paradigm
• Learning two-tape automata from queries and counterexamples
• A McCulloch-Pitts neural net to characterize even linear languages
• On two-sided locally testable languages
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
• Even linear simple matrix languages: formal language properties and grammatical inference.
• LARS: a learning algorithm for rewriting systems
• Learning strongly deterministic even linear languages from positive examples
• Learning Efficiency of Very Simple Grammars from Positive Data

This page was built for publication: Grammatical inference for even linear languages based on control sets

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