Formal languages
Grammars, grammar systems, and GSM mappings with valences
Mathematical aspects of natural and formal languages
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Grammars with controlled derivations
Handbook of formal languages, vol. 2
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
The Accepting Power of Finite Automata over Groups
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Context-Free Valence Grammars - Revisited
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Valences in Lindenmayer Systems
Fundamenta Informaticae
Valuated and Valence Grammars: An Algebraic View
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Weighted grammars and automata with threshold interpretation
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Valence languages generated by equality sets
Journal of Automata, Languages and Combinatorics
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Polycyclic and Bicyclic Valence Automata
Language and Automata Theory and Applications
Rational subsets of polycyclic monoids and valence automata
Information and Computation
Semigroup automata with rational initial and terminal sets
Theoretical Computer Science
Languages generated by context-free grammars extended by type AB → BA rules
Journal of Automata, Languages and Combinatorics
On the capabilities of grammars, automata, and transducers controlled by monoids
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A sufficient condition for erasing productions to be avoidable
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 5.24 |
We discuss the model of valence grammars, a simple extension of context-free grammars. We show closure properties of context-free valence languages over arbitrary monoids. Chomsky and Greibach normal form theorems and an iteration lemma for context-free valence grammars over the groups Zk are proved. The generative power of different control monoids is investigated. In particular, we show that context-free valence grammars over finite monoids or commutative monoids have the same power as valence grammars over finite groups or commutative groups, respectively.