scientific article; zbMATH DE number 1988980
From MaRDI portal
Publication:4430309
Cited in
(11)- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Balance of many-valued transductions and equivalence problems
- Multiplicities: A deterministic view of nondeterminism
- On the size of independent systems of equations in semigroups
- Finite transducers and rational transductions
- Equations over the \(k\)-binomial monoids
- A compactness property of the \(k\)-abelian monoids
- Compactness of systems of equations in semigroups
- On the size of independent systems of equations in semigroups
- Systems of equations over a finite set of words and automata theory
- Equations over finite sets of words and equivalence problems in automata theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430309)
