Pages that link to "Item:Q1041050"
From MaRDI portal
The following pages link to Rational subsets of polycyclic monoids and valence automata (Q1041050):
Displayed 9 items.
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- Semigroup automata with rational initial and terminal sets (Q2268859) (← links)
- On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (Q3012922) (← links)
- (Q3304144) (← links)
- Polycyclic and Bicyclic Valence Automata (Q3540137) (← links)
- The inclusion structure of partially lossy queue monoids and their trace submonoids (Q4553833) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem (Q5875891) (← links)