A word reconstruction problem for polynomial regular languages
From MaRDI portal
Cites work
- q-Parikh matrices and q-deformed binomial coefficients of words
- A refinement of Christol's theorem for algebraic power series
- Algorithms in real algebraic geometry
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Bounded Regular Sets
- Characterizing injectivity of classes of maps via classes of matrices
- Characterizing regular languages with polynomial densities
- Combined Decision Techniques for the Existential Theory of the Reals
- Construction of regular languages and recognizability of polynomials
- Equations over the \(k\)-binomial monoids
- Extending Parikh matrices
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- scientific article; zbMATH DE number 417855 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1157650 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- On a reconstruction problem for sequences
- QEPCAD B
- Reconstructing words using queries on subwords or factors
- Reconstruction from subsequences.
- Reconstruction of sequences
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- Unique Reconstruction of Coded Strings From Multiset Substring Spectra
This page was built for publication: A word reconstruction problem for polynomial regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842185)
