Pages that link to "Item:Q800098"
From MaRDI portal
The following pages link to On regularity of languages generated by copying systems (Q800098):
Displaying 15 items.
- Languages generated by iterated idempotency (Q868949) (← links)
- On noncounting regular classes (Q1193624) (← links)
- On the regularity of languages on a binary alphabet generated by copying systems (Q1205714) (← links)
- The tandem duplication distance problem is hard over bounded alphabets (Q2115851) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- On Regularity-Preservation by String-Rewriting Systems (Q3540126) (← links)
- (Q4812230) (← 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)
- Watson–Crick Jumping Finite Automata (Q5859652) (← links)
- The longest letter-duplicated subsequence and related problems (Q6592112) (← links)