Grammatical inference for even linear languages based on control sets
From MaRDI portal
Publication:1111403
DOI10.1016/0020-0190(88)90208-6zbMATH Open0658.68094OpenAlexW2084578840MaRDI QIDQ1111403FDOQ1111403
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
Recommendations
- scientific article
- 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
- scientific article; zbMATH DE number 2089362
- Controlled pure grammar systems
- A general framework for sequential grammars with control mechanisms
Cites Work
Cited In (21)
- A grammatical inference for harmonic linear languages
- Relations between Control Mechanisms for Sequential Grammars1
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors
- Language learning from membership queries and characteristic examples
- Learning efficiency of very simple grammars from positive data
- Title not available (Why is that?)
- The grammatical inference problem for the Szilard languages of linear grammars
- Title not available (Why is that?)
- 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
- Input–output identification of controlled discrete manufacturing 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
- 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)
