Pages that link to "Item:Q1622958"

The following pages link to On the commutative equivalence of context-free languages (Q1622958):

Displaying 21 items.

• On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
• On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
• On regularity of context-free languages (Q759489) (← links)
• Equivalence of regular expressions over a partially commutative alphabet (Q1040402) (← links)
• On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages (Q1070829) (← links)
• On commutative context-free languages (Q1092674) (← links)
• Prefix and equality languages of rational functions are co-context-free (Q1124356) (← links)
• Remarks about commutative context-free languages (Q1267720) (← links)
• The commutative closure of a binary slip-language is context-free: A new proof. (Q1414244) (← links)
• Context-freeness of the power of context-free languages is undecidable (Q1826642) (← links)
• On the equivalence problem of context-free and DT0L languages (Q1961239) (← links)
• \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
• Coding by minimal linear grammars (Q2192369) (← links)
• On bounded linear codes and the commutative equivalence (Q2220842) (← links)
• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
• On the commutative equivalence of bounded context-free and regular languages (Q2789520) (← links)
• The conjecture of Fliess on commutative context-free languages (Q3476286) (← links)
• Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
• On languages satisfying “interchange Lemma” (Q5286056) (← links)
• (Q5661156) (← links)
• On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)