Pages that link to "Item:Q786545"
From MaRDI portal
The following pages link to Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545):
Displayed 24 items.
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← 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)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
- Multiple constraints on three and four words (Q2474221) (← links)
- (Q3334093) (← links)
- Loops in automata and HDTOL relations (Q3479541) (← links)
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102) (← links)
- The descending chain condition on solution sets for systems of equations in groups (Q3708973) (← links)
- Finite degrees of ambiguity in pattern languages (Q4365010) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)