On the index of a context-free grammar and language

DOI10.1016/S0019-9958(69)90164-8MaRDI QIDQ5571706zbMATH OpenFDO

Authors Arto Salomaa

Publication date 1969

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

Full work available at URL https://doi.org/10.1016/S0019-9958(69)90164-8

zbMATH Keywords

languages, automata, networks

Cited in

(22)

• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
• Context-free grammar forms
• Grammarforms and grammarhomomorphisms
• On the family of finite index matrix languages
• An infinite pebble game and applications
• On strongly context-free languages
• Langages à un compteur
• Theory of formal grammars
• On the splicing operation
• The emptiness problem for valence automata over graph monoids
• On the degree of non-regularity of context-free languages
• Newton’s Method for ω-Continuous Semirings
• A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
• On the generative capacity of context-free matrix forms
• scientific article; zbMATH DE number 3669877 (Why is no real title available?)
• scientific article; zbMATH DE number 3438423 (Why is no real title available?)
• Outils et résultats pour les transducteurs boustrophédons
• scientific article; zbMATH DE number 3797186 (Why is no real title available?)
• On the Commutative Equivalence of Algebraic Formal Series and Languages
• Rational index of languages defined by grammars with bounded dimension of parse trees
• On the index of positive programmed formal languages
• On the intersection problem for quantum finite automata

This page was built for publication: On the index of a context-free grammar and language

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