Grammar and L forms: an introduction
From MaRDI portal
Publication:1055198
zbMath0521.68085MaRDI QIDQ1055198
Publication date: 1980
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
context-free languagesrecursively enumerable languagesmatrix grammarsformal grammarsEOL grammarsEOL formscontext free grammar formscontrolled grammarsEIL grammarsETOL formsETOL grammarsgrammar formsgrammatical families
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Testing for grammatical coverings, On erasing in E0L forms, Inference algorithms for developmental systems with cell lineages, Unnamed Item, On homomorphic images of left szilard languages, Colorings and interpretations: a connection between graphs and grammar forms, Recursion and pumping in L forms, On minimal graphs, Sub-regular grammar forms, Completeness of context-free grammar forms, Color-families are dense, Decidability and density in two-symbol grammar forms, On form-equivalence of deterministic pure grammar forms, A note on the similarity depth, Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms, Basic formulas and languages. I: The theory, Basic formulas and languages. II: Applications to EOL systems and forms, Abstract grammars based on transductions, Power languages and density, Descriptional complexity of context-free grammar forms, The goodness of \(\{S,a\}\)-EOL forms is decidable, A prime decomposition theorem for grammatical families, Derick Wood: Always in Our Hearts, EOL forms and finite substitutions of ol forms, Invito alla teoria dei linguaggi formali, Finitary and infinitary interpretations of languages, On the equality of grammatical families, On simulation and propagating EOL forms, Context-free grammar forms with strict interpretations, Symmetric graphs and interpretations, The undecidability of form equivalence for context-free and EOL forms
