On a family of linear grammars
From MaRDI portal
Publication:5513763
DOI10.1016/S0019-9958(64)90294-3zbMath0139.00703OpenAlexW1984086143MaRDI QIDQ5513763
Gianfranco R. Putzolu, V. Amar
Publication date: 1964
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(64)90294-3
Related Items
On the closure properties of linear conjunctive languages., A McCulloch-Pitts neural net to characterize even linear languages, A descriptive characterisation of linear languages, Inference of even linear grammars and its application to picture description languages, Grammatical inference for even linear languages based on control sets, Deletion along trajectories, Unnamed Item, Learning deterministic even linear languages from positive examples, Learning strongly deterministic even linear languages from positive examples, On closure properties of \(\mathcal{L}\)-valued linear languages, On generators and generative capacity of EOL forms, A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages, \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter, Simple picture processing based on finite automata and regular grammars, Two-Sided Strictly Locally Testable Languages, On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN, On 5′→3′ Sensing Watson-Crick Finite Automata, Domain mu-calculus, Homomorphic characterizations of recursively enumerable languages with very small language classes, A note on the class of languages generated by F-systems over regular languages, Even linear simple matrix languages: formal language properties and grammatical inference.
