Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Matrix Equations and Normal Forms for Context-Free Grammars - MaRDI portal

Matrix Equations and Normal Forms for Context-Free Grammars

From MaRDI portal
Publication:5526989

DOI10.1145/321406.321412zbMath0148.25102OpenAlexW2022770634MaRDI QIDQ5526989

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



Related Items

The theory of languages, Context-free grammars with cancellation properties, Context-free graph languages of bounded degree are generated by apex graph grammars, Greibach normal form transformation, revisited, Arithmetic Circuits, Monomial Algebras and Finite Automata, A descriptive characterisation of linear languages, The theory of languages, Unnamed Item, Unnamed Item, A method for transforming grammars into LL(k) form, A survey on automata with translucent letters, A pumping lemma for flip-pushdown languages, Identification in the Limit of k,l-Substitutable Context-Free Languages, A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata, On the expressive power of stateless ordered restart-delete automata, Language equivalence of probabilistic pushdown automata, On Greibach normal form construction, An elementary proof of double Greibach normal form, Algebraically complete semirings and Greibach normal form, An elementary proof of a generalization of double Greibach normal form, Limited automata and unary languages, A Greibach normal form for context-free graph grammars, 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, On Greibach normal form construction, Theory of formal grammars, 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, Double Greibach operator grammars, Greibach normal form transformation revisited.