Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Extensions to Barrington's M-program model
Theoretical Computer Science - Special issue on structure in complexity theory
Grammars, grammar systems, and GSM mappings with valences
Mathematical aspects of natural and formal languages
Automata, Languages, and Machines
Automata, Languages, and Machines
Sequential grammars and automata with valances
Theoretical Computer Science
Varieties Of Formal Languages
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Blind Counter Automata on ω-Words
Fundamenta Informaticae
| Hi-index | 0.00 |
Valence grammars were introduced by Gh. P驴un in [8] as a grammatical model of chemical processes. Here, we focus on discussing a simpler variant which we call valuated grammars.We give some algebraic characterizations of the corresponding language classes. Similarly, we obtain an algebraic characterization of the linear languages. We also give some Nivat-like representations of valence transductions.