Test sets for finite substitutions
From MaRDI portal
Recommendations
Cites work
- A proof of Ehrenfeucht's conjecture
- scientific article; zbMATH DE number 3367062 (Why is no real title available?)
- The descending chain condition on solution sets for systems of equations in groups
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- The Semigroup of Ideals of a Fir is (Usually) Free
Cited in
(7)- On cancellation properties of languages which are supports of rational power series
- A proof of Ehrenfeucht's conjecture
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Test sets for languages of infinite words
- scientific article; zbMATH DE number 3883627 (Why is no real title available?)
- Finite test-sets for overlap-free morphisms
- New techniques for proving the decidability of equivalence problem
This page was built for publication: Test sets for finite substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075775)