Pages that link to "Item:Q1070831"

The following pages link to An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831):

Displaying 9 items.

• Regular languages and partial commutations (Q391641) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
• Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
• The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
• Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
• Sparse and slender subsets of monoids. (Q2480765) (← links)
• Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)