Pages that link to "Item:Q4140409"

The following pages link to The decidability of the equivalence problem for DOL-systems (Q4140409):

Displaying 37 items.

• Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
• Bounds for the D0L language equivalence problem (Q598185) (← links)
• On some decidability problems for HDOL systems with nonsingular Parikh matrices (Q599513) (← links)
• Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
• Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← 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)
• 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 test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
• Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
• Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
• Interactive L systems with a fast local growth (Q1115192) (← 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)
• On infinite words obtained by iterating morphisms (Q1168084) (← links)
• The decidability of v-local catenativity and of other properties of DOL systems (Q1243142) (← links)
• Lindenmayer grammars and symbolic testing (Q1244821) (← links)
• On the decidability of homomorphism equivalence for languages (Q1251076) (← links)
• Some decidability results about regular and pushdown translations (Q1253937) (← links)
• The decidability of the FOL-DOL equivalence problem (Q1256322) (← links)
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem (Q1258182) (← links)
• On the subword equivalence problem for morphic words (Q1363770) (← links)
• Equality sets of binary D0L sequences (Q1637341) (← links)
• The language equivalence problem for HD0L systems having D0L growths (Q1763705) (← links)
• Dominoes over a free monoid (Q1838319) (← links)
• The equivalence problem for DF0L languages and power series. (Q1872710) (← links)
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
• A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← 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)