Parameter-reduction of higher level grammars

DOI10.1016/0304-3975(87)90089-2zbMath0638.68070OpenAlexW1992469969MaRDI QIDQ1099634

Helmut Seidl

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90089-2

zbMATH Keywords

complexity of algorithmsdeletion capabilityhigher level grammarOI-grammarparameter-reduced grammarterminating grammar

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• A representation of trees by languages. II
• The lambda calculus, its syntax and semantics
• The IO- and OI-hierarchies
• Un théorème de duplication pour les forets algébriques
• A generalized approach to formal languages
• IO and OI. II
• Fully abstract models of typed \(\lambda\)-calculi
• Program transformations and algebraic semantics
• On the computational power of pushdown automata
• n-Rational Algebras I. Basic Properties and Free Algebras
• The Expressiveness of Simple and Second-Order Type Structures
• An automata-theoretical characterization of the OI-hierarchy
• Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
• Forêts Algébriques et Homomorphismes Inverses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameter-reduction of higher level grammars