Pages that link to "Item:Q5929312"
From MaRDI portal
The following pages link to Extended finite automata over groups (Q5929312):
Displaying 17 items.
- On the group memory complexity of extended finite automata over groups (Q2210871) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Word problems recognisable by deterministic blind monoid automata (Q2508978) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- Homing vector automata (Q2969985) (← links)
- Context-sensitive languages and G-automata (Q2986660) (← links)
- On the Expressive Power of Valences in Cooperating Distributed Grammar Systems (Q3009339) (← links)
- On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (Q3012922) (← links)
- Polycyclic and Bicyclic Valence Automata (Q3540137) (← links)
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY (Q3606557) (← links)
- Formal Languages and Groups as Memory (Q3618533) (← links)
- (Q5016373) (← links)
- Automata with Counters that Recognize Word Problems of Free Products (Q5250278) (← links)
- EXTENDED FINITE AUTOMATA AND WORD PROBLEMS (Q5316306) (← links)
- UNAMBIGUOUS CONSTRAINED AUTOMATA (Q5495422) (← links)
- Jump complexity of finite automata with translucent letters (Q6190004) (← links)
- On the Degree of Extension of Some Models Defining Non-Regular Languages (Q6204122) (← links)
