Pages that link to "Item:Q786545"

The following pages link to Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545):

Displaying 28 items.

• 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)
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
• New techniques for proving the decidability of equivalence problem (Q913523) (← links)
• On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
• On the equivalence of some transductions involving letter to letter morphisms on regular languages (Q1058303) (← links)
• Inverse morphic equivalence on languages (Q1061490) (← links)
• On test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
• Test sets for morphisms with bounded delay (Q1067414) (← links)
• A proof of Ehrenfeucht's conjecture (Q1082090) (← links)
• Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht (Q1087020) (← links)
• On the defect theorem and simplifiability (Q1090421) (← links)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← 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)
• On the independence of equations in three variables. (Q1426042) (← links)
• Systems of word equations, polynomials and linear algebra: a new approach (Q1631611) (← links)
• Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
• Finite transducers and rational transductions (Q2074205) (← links)
• A compactness property of the \(k\)-abelian monoids (Q2192368) (← links)
• On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
• Multiple constraints on three and four words (Q2474221) (← links)
• On maximal chains of systems of word equations (Q2510762) (← links)
• One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399) (← links)
• (Q3334093) (← links)
• An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5002823) (← links)
• On the equivalence problem for deterministic multitape automata and transducers (Q5096179) (← links)