Pages that link to "Item:Q685449"

The following pages link to Equations over finite sets of words and equivalence problems in automata theory (Q685449):

Displaying 5 items.

• On the existence of prime decompositions (Q880173) (← links)
• The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
• Undecidability of the equivalence of finite substitutions on regular language (Q4265533) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)