Pages that link to "Item:Q1605318"
From MaRDI portal
The following pages link to Sequential grammars and automata with valences (Q1605318):
Displayed 15 items.
- Rational subsets of polycyclic monoids and valence automata (Q1041050) (← links)
- Semigroup automata with rational initial and terminal sets (Q2268859) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (Q3012922) (← links)
- Polycyclic and Bicyclic Valence Automata (Q3540137) (← links)
- Formal Languages and Groups as Memory (Q3618533) (← links)
- The inclusion structure of partially lossy queue monoids and their trace submonoids (Q4553833) (← links)
- (Q5016373) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
- On the Degree of Extension of Some Models Defining Non-Regular Languages (Q6204122) (← links)