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 13 items.

• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
• On the existence of prime decompositions (Q880173) (← links)
• The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
• On the size of independent systems of equations in semigroups (Q1351001) (← links)
• Band monoid languages revisited (Q1576298) (← links)
• The equational theory of regular words (Q1776401) (← links)
• Solving language equations using flanked automata (Q1990504) (← links)
• The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
• Undecidability of the equivalence of finite substitutions on regular language (Q4265533) (← links)
• (Q4662830) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• (Q5111428) (← links)
• The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)