The following pages link to Florin Manea (Q256424):
Displaying 35 items.
- (Q5092406) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- (Q5136316) (← links)
- (Q5146527) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- On Subregular Selection Languages in Internal Contextual Grammars. (Q5178452) (← links)
- Deciding Networks of Evolutionary Processors (Q5199978) (← links)
- On Contextual Grammars with Subregular Selection Languages (Q5200087) (← links)
- k-Local Internal Contextual Grammars (Q5200090) (← links)
- Rollercoasters: Long Sequences without Short Runs (Q5232132) (← links)
- INNER PALINDROMIC CLOSURE (Q5247174) (← links)
- Inner Palindromic Closure (Q5300837) (← links)
- Discovering Hidden Repetitions in Words (Q5326371) (← links)
- Factorizing a String into Squares in Linear Time (Q5369562) (← links)
- Syllabic Languages and Go-through Automata (Q5415289) (← links)
- Hairpin Completion Versus Hairpin Reduction (Q5425355) (← links)
- (Q5445182) (← links)
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size (Q5452560) (← links)
- Machines, Computations, and Universality (Q5710886) (← links)
- New Computational Paradigms (Q5717054) (← links)
- (Q5740429) (← links)
- Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results (Q5744129) (← links)
- On the size complexity of universal accepting hybrid networks of evolutionary processors (Q5756979) (← links)
- Equations enforcing repetitions under permutations (Q5915744) (← links)
- Quantum walks and search algorithms (Q5917872) (← links)
- Equations enforcing repetitions under permutations (Q5918930) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- (Q6168464) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- On the number of factors in the LZ-End factorization (Q6545432) (← links)
- Enumerating \(m\)-length walks in directed graphs with constant delay (Q6547915) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- Subsequences with gap constraints: complexity bounds for matching and analysis problems (Q6602491) (← links)
- On the structure of solution-sets to regular word equations (Q6614609) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)
