Equality sets of binary D0L sequences
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3990879 (Why is no real title available?)
- scientific article; zbMATH DE number 3746452 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A characterization of regular languages as equality sets of HDT0L sequences
- A short solution for the HDT0L sequence equivalence problem
- Binary equality sets are generated by two words
- D0L sequence equivalence is inPfor fixed alphabets
- D0L sequences and their equality sets
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Equality sets of morphic word sequences
- On some decidability problems for HDOL systems with nonsingular Parikh matrices
- On the equivalence problem for binary DOL systems
- The decidability of the equivalence problem for DOL-systems
Cited in
(6)- Binary equality sets are generated by two words
- D0L sequences and their equality sets
- Comparing subword occurrences in binary D0L sequences
- Equality sets of morphic word sequences
- scientific article; zbMATH DE number 1948502 (Why is no real title available?)
- D0L sequence equivalence is inPfor fixed alphabets
This page was built for publication: Equality sets of binary D0L sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637341)