Matrix Equations and Normal Forms for Context-Free Grammars

DOI10.1145/321406.321412MaRDI QIDQ5526989zbMATH OpenOpenAlexFDO

Authors Daniel J. Rosenkrantz

Publication date 1967

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321406.321412

zbMATH Keywords

mathematical logic

Cited in

(32)

• Context-free grammars with cancellation properties
• A method for transforming grammars into LL(k) form
• An elementary proof of double Greibach normal form
• The concept of a linguistic variable and its application to approximate reasoning. I
• The concept of a linguistic variable and its application to approximate reasoning. II
• The concept of a linguistic variable and its application to approximate reasoning. III
• From left-regular to Greibach normal form grammars
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Double Greibach operator grammars
• Algebraically complete semirings and Greibach normal form
• Theory of formal grammars
• Greibach normal form transformation revisited.
• On the expressive power of stateless ordered restart-delete automata
• Language equivalence of probabilistic pushdown automata
• A pumping lemma for flip-pushdown languages
• Arithmetic Circuits, Monomial Algebras and Finite Automata
• A characterization of the context-free languages by stateless ordered restart-delete automata
• scientific article; zbMATH DE number 3868648 (Why is no real title available?)
• Identification in the Limit of k,l-Substitutable Context-Free Languages
• ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT‐FREE GRAMMAR USING AN ALGEBRAIC APPROACH
• An efficient algorithm for finding kleene closure of regular expression matrices
• On h-lexicalized restarting list automata
• Greibach normal form transformation, revisited
• A Greibach normal form for context-free graph grammars
• The theory of languages
• The theory of languages
• On Greibach normal form construction
• Limited automata and unary languages
• On Greibach normal form construction
• A survey on automata with translucent letters
• A descriptive characterisation of linear languages
• An elementary proof of a generalization of double Greibach normal form

This page was built for publication: Matrix Equations and Normal Forms for Context-Free Grammars

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