Pages that link to "Item:Q1148122"
From MaRDI portal
The following pages link to Test sets and checking words for homomorphism equivalence (Q1148122):
Displayed 20 items.
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← 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 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)
- On cancellation properties of languages which are supports of rational power series (Q1066677) (← 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)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
- A closure property of deterministic context-free languages (Q1149789) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Checking sets, test sets, rich languages and commutatively closed languages (Q1837540) (← links)
- Strongly prime PCP words (Q1902906) (← links)
- (Q3334093) (← links)
- The descending chain condition on solution sets for systems of equations in groups (Q3708973) (← links)
- Polynomial size test sets for context-free languages (Q5204306) (← links)
- PCP-prime words and primality types (Q5286055) (← links)