The following pages link to (Q3793751):
Displaying 7 items.
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- On the system of word equations \(x^ i_ 1 x^ i_ 2\dots x^ i_ m=y^ i_ 1 y^ i_ 2\dots y^ i_ n\) \((i=1,2,\dots)\) in a free monoid (Q1357811) (← links)
- On the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoid (Q1960659) (← links)
- Loops in automata and HDTOL relations (Q3479541) (← links)
- (Q4221612) (← links)
- On the equivalence problem for deterministic multitape automata and transducers (Q5096179) (← links)
