Pages that link to "Item:Q1082090"
From MaRDI portal
The following pages link to A proof of Ehrenfeucht's conjecture (Q1082090):
Displaying 36 items.
- A remark on the representation of trace monoids (Q584429) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Test sets for finite substitutions (Q1075775) (← links)
- The Ehrenfeucht conjecture: An algebra-framework for its proof (Q1080530) (← links)
- On the defect theorem and simplifiability (Q1090421) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- Test sets for languages of infinite words (Q1113683) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- On the size of independent systems of equations in semigroups (Q1351001) (← links)
- A note on decidability questions on presentations of word semigroups (Q1391138) (← links)
- Multiple factorizations of words and defect effect (Q1605328) (← links)
- Systems of word equations, polynomials and linear algebra: a new approach (Q1631611) (← links)
- Explicit test sets for iterated morphisms in free monoids and metabelian groups (Q1763708) (← links)
- On some variants of the Ehrenfeucht conjecture (Q1822520) (← links)
- Many aspects of defect theorems (Q1882912) (← links)
- On 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 monoid (Q1960659) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Equations over the \(k\)-binomial monoids (Q2140471) (← links)
- A compactness property of the \(k\)-abelian monoids (Q2192368) (← links)
- Algebraic properties of word equations (Q2343519) (← links)
- On systems of word equations with simple loop sets (Q2373758) (← links)
- On maximal chains of systems of word equations (Q2510762) (← links)
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399) (← links)
- Linear size test sets for certain commutative languages (Q3149085) (← links)
- Equations in the Partial Semigroup of Words with Overlapping Products (Q3166946) (← links)
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102) (← links)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- An Analysis and a Reproof of Hmelevskii’s Theorem (Q3533033) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5002823) (← links)
- (Q5090448) (← links)
- (Q5090989) (← links)
- (Q5092324) (← links)
