Pages that link to "Item:Q1258182"

The following pages link to Elementary homomorphisms and a solution of the DOL sequence equivalence problem (Q1258182):

Displaying 40 items.

• On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
• Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
• Bispecial factors in circular non-pushy D0L languages (Q442285) (← links)
• An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
• Bounds for the D0L language equivalence problem (Q598185) (← links)
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
• A new bound for the D0L sequence equivalence problem (Q855272) (← links)
• The minimum substring cover problem (Q958306) (← links)
• On the simplification of infinite morphic words (Q1006088) (← links)
• On the defect theorem and simplifiability (Q1090421) (← links)
• Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
• Test sets and checking words for homomorphism equivalence (Q1148122) (← links)
• On a bound for the DOL sequence equivalence problem (Q1151051) (← links)
• Every two equivalent DOL systems have a regular true envelope (Q1157969) (← links)
• The decidability of the DOL-DTOL equivalence problem (Q1167540) (← links)
• Maximal codes with bounded deciphering delay (Q1177932) (← links)
• On D0L power series (Q1575708) (← links)
• Equality sets of binary D0L sequences (Q1637341) (← links)
• The language equivalence problem for HD0L systems having D0L growths (Q1763705) (← links)
• On the deficit of a finite set of words (Q1822632) (← links)
• Checking sets, test sets, rich languages and commutatively closed languages (Q1837540) (← links)
• The equivalence problem for DF0L languages and power series. (Q1872710) (← links)
• Characterization of circular D0L-systems (Q2272391) (← links)
• A characterization of free pairs of upper triangular free monoid morphisms (Q2417854) (← links)
• Defect theorems with compatibility relations. (Q2480767) (← links)
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
• Equality sets of morphic word sequences (Q2841980) (← links)
• REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM (Q3021985) (← links)
• THE D0L ω-EQUIVALENCE PROBLEM (Q3426793) (← links)
• Elementariness of a finite set of words is co-NP-complete (Q3484360) (← links)
• D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
• Compatibility relations on codes and free monoids (Q3526416) (← links)
• ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS (Q3646166) (← links)
• A bound for the<i>ω</i>-equivalence problem of polynomial D0L systems (Q4825477) (← links)
• Reachability via Cooperating Morphisms (Q4982083) (← links)
• A periodicity property of iterated morphisms (Q5441548) (← links)
• The Minimum Substring Cover Problem (Q5443381) (← links)
• Easy cases of the D0L sequence equivalence problem (Q5951971) (← links)
• Recognizability of morphisms (Q6068415) (← links)
• Decidable problems in substitution shifts (Q6126479) (← links)