The following pages link to Florin Manea (Q256424):
Displaying 50 items.
- Networks of evolutionary processors: computationally complete normal forms (Q256426) (← links)
- Language theoretical properties of hairpin formations (Q418760) (← links)
- On external contextual grammars with subregular selection languages (Q443738) (← links)
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- Tools in the Riemannian geometry of quantum computation (Q452237) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Complexity-preserving simulations among three variants of accepting networks of evolutionary processors (Q537856) (← links)
- Bounded hairpin completion (Q553314) (← links)
- A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
- Modeling time in computing. (Q714629) (← links)
- Complexity results for deciding networks of evolutionary processors (Q714866) (← links)
- Regular languages of partial words (Q726150) (← links)
- The extended equation of Lyndon and Schützenberger (Q730507) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction (Q1004085) (← links)
- On some algorithmic problems regarding the hairpin completion (Q1026117) (← links)
- On matching generalised repetitive patterns (Q1622969) (← links)
- Unary patterns under permutations (Q1659986) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- Hide and seek with repetitions (Q1713479) (← links)
- Solving a combinatorial problem with network flows (Q1767398) (← links)
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- The hardness of counting full words compatible with partial words (Q1936243) (← links)
- Fast and longest rollercoasters (Q2118392) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Accepting networks of evolutionary processors with subregular filters (Q2254489) (← links)
- \(k\)-spectra of weakly-\(c\)-balanced words (Q2327562) (← links)
- On solving word equations using SAT (Q2330594) (← links)
- Matching patterns with variables (Q2333028) (← links)
- Cubic patterns with permutations (Q2353404) (← links)
- Networks of evolutionary processors: the power of subregular filters (Q2376983) (← links)
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954) (← links)
- Prefix-suffix duplication (Q2453545) (← links)
- Freeness of partial words (Q2465643) (← links)
- An efficient approach for the rank aggregation problem (Q2503315) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Absent subsequences in words (Q2695493) (← links)
- On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters (Q2805395) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- (Q2819386) (← links)
- (Q2851709) (← links)
- Connecting Partial Words and Regular Languages (Q2904404) (← links)
