Pages that link to "Item:Q3618533"

The following pages link to Formal Languages and Groups as Memory (Q3618533):

Displaying 27 items.

• \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
• The algebraic theory of Parikh automata (Q722218) (← links)
• Rational subsets of polycyclic monoids and valence automata (Q1041050) (← links)
• The monoid of queue actions (Q1702520) (← links)
• Knapsack in graph groups (Q1702854) (← links)
• Counter machines and crystallographic structures (Q2003451) (← links)
• Principal abstract families of weighted tree languages (Q2064529) (← links)
• Semigroup automata with rational initial and terminal sets (Q2268859) (← links)
• Weighted automata with storage (Q2280328) (← links)
• Rational subsets and submonoids of wreath products. (Q2347806) (← links)
• The transformation monoid of a partially lossy queue (Q2399374) (← links)
• On strong affine representations of the polycyclic monoids (Q2413513) (← links)
• The emptiness problem for valence automata over graph monoids (Q2662504) (← 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 Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (Q3012922) (← links)
• (Q3304144) (← links)
• (Q3386623) (← links)
• Polycyclic and Bicyclic Valence Automata (Q3540137) (← links)
• The inclusion structure of partially lossy queue monoids and their trace submonoids (Q4553833) (← links)
• (Q5090942) (← links)
• Languages Accepted by Weighted Restarting Automata* (Q5164872) (← links)
• New Results on Vector and Homing Vector Automata (Q5207237) (← links)
• Language classes associated with automata over matrix groups (Q5223619) (← links)
• Automata with Counters that Recognize Word Problems of Free Products (Q5250278) (← links)
• Rational weighted tree languages with storage (Q6647747) (← links)