Pages that link to "Item:Q1233317"

The following pages link to Finite automata with multiplication (Q1233317):

Displaying 20 items.

• One-way simple multihead finite automata are not closed under concatenation (Q1056554) (← links)
• Alternating simple multihead finite automata (Q1058853) (← links)
• Simple counter machines and number-theoretic problems (Q1136223) (← links)
• Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
• Finite automata with multiplication (Q1233317) (← links)
• One-way simple multihead finite automata (Q1258608) (← links)
• Sequential grammars and automata with valences (Q1605318) (← links)
• On the sentence valuation in a semiring (Q1810466) (← links)
• On the group memory complexity of extended finite automata over groups (Q2210871) (← links)
• Word problems recognisable by deterministic blind monoid automata (Q2508978) (← links)
• Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
• FINITE AUTOMATA OVER FREE GROUPS (Q2709977) (← links)
• Homing vector automata (Q2969985) (← links)
• GENERALIZED COUNTERS AND REVERSAL COMPLEXITY (Q3606557) (← links)
• Formal Languages and Groups as Memory (Q3618533) (← links)
• (Q5016373) (← links)
• New Results on Vector and Homing Vector Automata (Q5207237) (← links)
• Language classes associated with automata over matrix groups (Q5223619) (← links)
• Extended finite automata over groups (Q5929312) (← links)
• Jump complexity of finite automata with translucent letters (Q6190004) (← links)