Grammatical inference for even linear languages based on control sets
From MaRDI portal
Publication:1111403
DOI10.1016/0020-0190(88)90208-6zbMath0658.68094OpenAlexW2084578840MaRDI QIDQ1111403
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
Related Items
A McCulloch-Pitts neural net to characterize even linear languages, LARS: a learning algorithm for rewriting systems, Unnamed Item, Recent advances of grammatical inference, Learning deterministic even linear languages from positive examples, Grammatical inference: An old and new paradigm, Learning strongly deterministic even linear languages from positive examples, Language learning from membership queries and characteristic examples, A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages, Learning Efficiency of Very Simple Grammars from Positive Data, The grammatical inference problem for the Szilard languages of linear grammars, A comparative analysis of recent identification approaches for discrete-event systems, Learning two-tape automata from queries and counterexamples, Two-Sided Strictly Locally Testable Languages, Input–output identification of controlled discrete manufacturing systems, Learning efficiency of very simple grammars from positive data, Even linear simple matrix languages: formal language properties and grammatical inference.
Cites Work
