Sequential grammars and automata with valences
From MaRDI portal
Publication:1605318
DOI10.1016/S0304-3975(01)00282-1zbMath1002.68079OpenAlexW2006891919MaRDI QIDQ1605318
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00282-1
Related Items (15)
On Boolean closed full trios and rational Kripke frames ⋮ Context-free commutative grammars with integer counters and resets ⋮ The inclusion structure of partially lossy queue monoids and their trace submonoids ⋮ The emptiness problem for valence automata over graph monoids ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Recent advances on reachability problems for valence systems (invited talk) ⋮ Unnamed Item ⋮ Polycyclic and Bicyclic Valence Automata ⋮ On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids ⋮ Semigroup automata with rational initial and terminal sets ⋮ Formal Languages and Groups as Memory ⋮ Rational subsets of polycyclic monoids and valence automata ⋮ Rational subsets and submonoids of wreath products. ⋮ Characterization and complexity results on jumping finite automata
Cites Work
- The complexity of decision problems for finite-turn multicounter machines
- Finite automata with multiplication
- Remarks on blind and partially blind one-way multicounter machines
- The complexity of the membership problem for some extensions of context-free languagest†
- VALENCE GRAMMARS WITH TARGET SETS
- Probabilistic and weighted grammars
- Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sequential grammars and automata with valences
