The following pages link to (Q3782812):
Displaying 8 items.
- 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)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- Test sets for finite substitutions (Q1075775) (← links)
- A proof of Ehrenfeucht's conjecture (Q1082090) (← links)
- Test sets for languages of infinite words (Q1113683) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)