A proof of Ehrenfeucht's conjecture

From MaRDI portal
Publication:1082090

DOI10.1016/0304-3975(85)90066-0zbMath0602.68066OpenAlexW1965895990WikidataQ123342920 ScholiaQ123342920MaRDI QIDQ1082090

B. George

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90066-0




Related Items (47)

Test sets for finite substitutionsThe Ehrenfeucht conjecture: An algebra-framework for its proofMany aspects of defect theoremsEquations in the Partial Semigroup of Words with Overlapping ProductsOn the defect theorem and simplifiabilityThe equivalence of finite valued transducers (on HDT0L languages) is decidableSystems of word equations, polynomials and linear algebra: a new approachOn systems of word equations with simple loop setsEquations over the \(k\)-binomial monoidsOn the size of independent systems of equations in semigroupsTest sets for languages of infinite wordsThe expressibility of languages and relations by word equationsA note on decidability questions on presentations of word semigroupsON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNSA compactness property of the \(k\)-abelian monoidsPolynomial size test sets for context-free languagesOn the Solution Sets of Entire Systems of Word EquationsD0L sequence equivalence is inPfor fixed alphabetsNew techniques for proving the decidability of equivalence problemOn the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoidAn Analysis and a Reproof of Hmelevskii’s TheoremThe Equivalence Problem of Finite Substitutions on ab*c, with ApplicationsPolynomial size test sets for commutative languagesCompactness of systems of equations in semigroupsMultiplicities: A deterministic view of nondeterminismEfficient constructions of test sets for regular and context-free languagesEquations over finite sets of words and equivalence problems in automata theoryExplicit test sets for iterated morphisms in free monoids and metabelian groupsOne-Variable Word Equations and Three-Variable Constant-Free Word EquationsUnnamed ItemUnnamed ItemUnnamed ItemA remark on the representation of trace monoidsLocal and global cyclicity in free semigroupsSolving word equationsOn maximal chains of systems of word equationsOne-Unknown Word Equations and Three-Unknown Constant-Free Word EquationsOn the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown EquationsOn some variants of the Ehrenfeucht conjectureOn the size of independent systems of equations in semigroupsFinite transducers and rational transductionsTest sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\)An Optimal Bound on the Solution Sets of One-Variable Word Equations and its ConsequencesAlgebraic properties of word equationsMultiple factorizations of words and defect effectAn Optimal Bound on the Solution Sets of One-Variable Word Equations and its ConsequencesLinear size test sets for certain commutative languages




Cites Work




This page was built for publication: A proof of Ehrenfeucht's conjecture