Pages that link to "Item:Q2849913"
From MaRDI portal
The following pages link to Semilinearity and Context-Freeness of Languages Accepted by Valence Automata (Q2849913):
Displaying 7 items.
- Rational subsets of polycyclic monoids and valence automata (Q1041050) (← 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)
- Bounded Context Switching for Valence Systems (Q5009426) (← links)
- The complexity of bidirected reachability in valence systems (Q6649456) (← links)
- On decision problems concerning contextual insertions and deletions (Q6652448) (← links)