Pages that link to "Item:Q1205714"

The following pages link to On the regularity of languages on a binary alphabet generated by copying systems (Q1205714):

Displayed 14 items.

• Well quasi-orders and context-free grammars (Q703570) ‎ (← links)
• Languages generated by iterated idempotency (Q868949) ‎ (← links)
• The tandem duplication distance problem is hard over bounded alphabets (Q2115851) ‎ (← links)
• Stefano Varricchio (1960-2008) (Q2267786) ‎ (← links)
• Prefix-suffix duplication (Q2453545) ‎ (← links)
• Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) ‎ (← links)
• Well Quasi-orders in Formal Language Theory (Q3533001) ‎ (← links)
• On Regularity-Preservation by String-Rewriting Systems (Q3540126) ‎ (← links)
• Computing the Tandem Duplication Distance is NP-Hard (Q5020832) ‎ (← links)
• Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) ‎ (← links)
• On the Prefix–Suffix Duplication Reduction (Q5217116) ‎ (← links)
• On Compensation Loops in Genomic Duplications (Q5217120) ‎ (← links)
• INNER PALINDROMIC CLOSURE (Q5247174) ‎ (← links)
• General Idempotency Languages Over Small Alphabets (Q5740529) ‎ (← links)