The following pages link to Bounded Parikh automata (Q2841977):
Displaying 18 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- Bounded underapproximations (Q453533) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On store languages and applications (Q2417850) (← links)
- Bounded Parikh automata (Q2789518) (← links)
- BORDERS AND FINITE AUTOMATA (Q3503101) (← links)
- Enumerated BSP Automata (Q4686652) (← links)
- (Q5009428) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- (Q5015278) (← links)
- Input-Position-Restricted Models of Language Acceptors (Q5112180) (← links)
- (Q5155662) (← links)
- DFA with a Bounded Activity Level (Q5404937) (← links)
- Jumping automata over Infinite words (Q6088920) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
- Jumping automata over infinite words (Q6661761) (← links)