Grammatical inference for even linear languages based on control sets
From MaRDI portal
We show that the grammatical inference problem for even linear languages is reduced to the problem for regular sets.
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
Cited in
(21)- 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
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors
- LARS: a learning algorithm for rewriting systems
- Learning Efficiency of Very Simple Grammars from Positive Data
- scientific article; zbMATH DE number 845930 (Why is no real title available?)
- Learning two-tape automata from queries and counterexamples
- On two-sided locally testable languages
- Relations between Control Mechanisms for Sequential Grammars1
- Two-Sided Strictly Locally Testable Languages
- Input-output identification of controlled discrete manufacturing systems
- A grammatical inference for harmonic linear languages
- 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
- The grammatical inference problem for the Szilard languages of linear grammars
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)
