Pure grammars

DOI10.1016/S0019-9958(80)90131-XMaRDI QIDQ3891788zbMATH OpenOpenAlexFDO

Authors Hermann Maurer, Arto Salomaa, D. Wood

Publication date 1980

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(80)90131-x

zbMATH Keywords

ambiguitydecidabilitylanguage hierarchieslength setsmonogenicitypure grammarssurvey

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Formal languages and automata (68Q45)

Cited in

(31)

• A regularity test for dual bordered OS systems
• A note on pure grammars
• Context-free grammars with selective rewriting
• Grammars with valuations - a discrete model for self-organization of biopolymers
• On form-equivalence of deterministic pure grammar forms
• Characterizations of recursively enumerable languages by means of insertion grammars
• Representation theorems using DOS languages
• Two-symbol DOS systems generating regular languages
• On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
• Modular materialisation of Datalog programs
• Language generating alphabetic flat splicing P systems
• Solutions to four open problems concerning controlled pure grammar systems
• Comparison of basic language generating devices (non-deterministic systems)
• Undecidability of Operation Problems for T0L Languages and Subclasses
• A remark on regularity of parallel languages
• A note on regular-controlled apical-growth filamentous systems
• Pure grammars and pure languages†
• Derivation languages of grammar forms†
• Decidability questions for insertion systems and related models
• Decidability of operation problems for T0L languages and subclasses
• An extension of complex role inclusion axioms in the description logic \(\mathcal{SROIQ}\)
• Operations and language generating devices suggested by the genome evolution
• Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems
• Array P systems and pure 2D context-free grammars with independent mode of rewriting
• An array P system based on a new variant of pure 2D context-free grammars
• A \(P\) system model with pure context-free rules for picture array generation
• Parallel contextual array insertion-deletion P systems and a variant of array rewriting P systems
• It is decidable whether a regular language is pure context-free
• On DOS languages and DOS mappings
• Homomorphic images of sentential form languages defined by semi-Thue systems
• Pure 2D picture grammars and languages

This page was built for publication: Pure grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3891788)