Pages that link to "Item:Q4534182"
From MaRDI portal
The following pages link to Recognizable languages in divisibility monoids (Q4534182):
Displaying 12 items.
- Weighted automata with discounting (Q963467) (← links)
- Languages recognized by programs over the two-element monoid (Q1118041) (← links)
- Counting monoids and rational languages (Q1176625) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Complete positive group presentations. (Q1409747) (← links)
- The representation theorem of persistence revisited and generalized (Q2316772) (← links)
- Finite transducers for divisibility monoids (Q2508976) (← links)
- Finitely generated algebras defined by homogeneous quadratic monomial relations and their underlying monoids. (Q2515628) (← links)
- Quasi-isometry and finite presentations of left cancellative monoids. (Q2852575) (← links)
- Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids (Q3098035) (← links)
- (Q4934333) (← links)
- The Generalized Rank of Trace Languages (Q5384435) (← links)