Pages that link to "Item:Q1251076"

The following pages link to On the decidability of homomorphism equivalence for languages (Q1251076):

Displaying 29 items.

• HDTOL matching of computations of multitape automata (Q582131) (← 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)
• 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)
• New techniques for proving the decidability of equivalence problem (Q913523) (← 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)
• On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages (Q1070829) (← links)
• Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht (Q1087020) (← links)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
• Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
• Every finitely generated submonoid of a free monoid has a finite Malcev's presentation (Q1123270) (← links)
• Test sets and checking words for homomorphism equivalence (Q1148122) (← links)
• 2DST mappings of languages and related problems (Q1164438) (← links)
• Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
• Some decidability results about regular and pushdown translations (Q1253937) (← links)
• Equivalence problem of mappings relative to languages (Q1364102) (← links)
• A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language (Q1820585) (← links)
• Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
• Checking sets, test sets, rich languages and commutatively closed languages (Q1837540) (← links)
• Dominoes over a free monoid (Q1838319) (← links)
• Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
• Finite transducers and rational transductions (Q2074205) (← links)
• A note on undercover relation (Q2265818) (← links)
• (Q3334093) (← links)
• On the equivalence problem for deterministic multitape automata and transducers (Q5096179) (← links)