Pages that link to "Item:Q798007"
From MaRDI portal
The following pages link to The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007):
Displaying 18 items.
- 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)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- On test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
- On three-element codes (Q1063421) (← links)
- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages (Q1070829) (← links)
- Test sets for finite substitutions (Q1075775) (← links)
- The Ehrenfeucht conjecture: An algebra-framework for its proof (Q1080530) (← 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)
- Every finitely generated submonoid of a free monoid has a finite Malcev's presentation (Q1123270) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- On the size of independent systems of equations in semigroups (Q1351001) (← links)
- (Q5090448) (← links)
- (Q5092324) (← links)
- On the size of independent systems of equations in semigroups (Q5096903) (← links)
- Polynomial size test sets for context-free languages (Q5204306) (← links)
