Recognizable languages in divisibility monoids
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1390068
- Recognizable languages in concurrency monoids
- scientific article; zbMATH DE number 2124368
- scientific article; zbMATH DE number 1839447
- Languages and monoids with disjunctive identity
- Counting monoids and rational languages
- Mathematical Foundations of Computer Science 2004
- Languages recognized by programs over the two-element monoid
- Language-theoretic problems in certain matrix monoids
- A kleene theorem for recognizable languages over concurrency monoids
Cited in
(14)- Languages recognized by programs over the two-element monoid
- Counting monoids and rational languages
- Representation of computations in concurrent automata by dependence orders
- Complete positive group presentations.
- The representation theorem of persistence revisited and generalized
- Finite transducers for divisibility monoids
- Finitely generated algebras defined by homogeneous quadratic monomial relations and their underlying monoids.
- Quasi-isometry and finite presentations of left cancellative monoids.
- Rational transformations and a Kleene theorem for power series over rational monoids
- The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets
- scientific article; zbMATH DE number 1839447 (Why is no real title available?)
- scientific article; zbMATH DE number 1390068 (Why is no real title available?)
- The generalized rank of trace languages
- Weighted automata with discounting
This page was built for publication: Recognizable languages in divisibility monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534182)
