The following pages link to Florin Manea (Q256424):
Displaying 50 items.
- Fine and Wilf’s Theorem and Pseudo-repetitions (Q2912765) (← links)
- k-Abelian Pattern Matching (Q2921982) (← links)
- Generalised Lyndon-Schützenberger Equations (Q2922033) (← links)
- A Stronger Square Conjecture on Binary Words (Q2938111) (← links)
- Longest Gapped Repeats and Palindromes (Q2946337) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- (Q2955004) (← links)
- Finding Pseudo-Repetitions (Q2957889) (← links)
- On the Pseudoperiodic Extension of u^l = v^m w^n (Q2963936) (← links)
- Testing Generalised Freeness of Words (Q2965496) (← links)
- Networks of Evolutionary Processors with Subregular Filters (Q3004585) (← links)
- On Normal Forms for Networks of Evolutionary Processors (Q3007707) (← links)
- Context Insertions (Q3009334) (← links)
- (Q3018967) (← links)
- (Q3022294) (← links)
- SOME REMARKS ON THE HAIRPIN COMPLETION (Q3056283) (← links)
- Periodicity Algorithms for Partial Words (Q3088064) (← links)
- Deciding According to the Shortest Computations (Q3091456) (← links)
- Hairpin Lengthening and Shortening of Regular Languages (Q3166949) (← links)
- The Avoidability of Cubes under Permutations (Q3167514) (← links)
- On Internal Contextual Grammars with Subregular Selection Languages (Q3167584) (← links)
- Combinatorial Queries and Updates on Partial Words (Q3183600) (← links)
- Networks of Evolutionary Picture Processors with Filtered Connections (Q3184758) (← links)
- Bounded Prefix-Suffix Duplication (Q3192263) (← links)
- (Q3409990) (← links)
- On Some Algorithmic Problems Regarding the Hairpin Completion (Q3439535) (← links)
- On the recognition of context-free languages using accepting hybrid networks of evolutionary processors (Q3446590) (← links)
- Prefix-Suffix Square Completion (Q3449365) (← links)
- Square-Density Increasing Mappings (Q3449366) (← links)
- Unary Patterns with Permutations (Q3451101) (← links)
- Hairpin lengthening: language theoretic and algorithmic results (Q3465044) (← links)
- (Q3518410) (← links)
- ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS (Q3542873) (← links)
- Hard Counting Problems for Partial Words (Q3564883) (← links)
- Hairpin Lengthening (Q3576217) (← links)
- Accepting Networks of Splicing Processors with Filtered Connections (Q3608485) (← links)
- Some Remarks on Superposition Based on Watson-Crick-Like Complementarity (Q3637240) (← links)
- Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof (Q3654667) (← links)
- Efficiently Finding All Maximal alpha-gapped Repeats (Q4601891) (← links)
- String Matching with Involutions (Q4648193) (← links)
- Generating Networks of Splicing Processors (Q4649456) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- (Q4964011) (← links)
- Rollercoasters and Caterpillars (Q5002684) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Pattern Matching with Variables (Q5053058) (← links)
- (Q5090479) (← links)
- (Q5091271) (← links)
