Search

Your search keyword '"Manea, Florin"' showing total 382 results

Search Constraints

Start Over You searched for: Author "Manea, Florin" Remove constraint Author: "Manea, Florin" Publication Type eBooks Remove constraint Publication Type: eBooks
382 results on '"Manea, Florin"'

Search Results

1. SMTQuery: Analysing SMT-LIB String Benchmarks

2. Enumerating m-Length Walks in Directed Graphs with Constant Delay

3. Matching Patterns with Variables Under Simon’s Congruence

4. On the Number of Factors in the LZ-End Factorization

5. Longest Common Subsequence with Gap Constraints

6. Matching Patterns with Variables Under Edit Distance

7. Subsequences in Bounded Ranges: Matching and Analysis Problems

8. Absent Subsequences in Words

9. String Theories Involving Regular Membership Predicates: From Practice to Theory and Back

10. An SMT Solver for Regular Expressions and Linear Arithmetic over String Length

11. Blocksequences of k-local Words

12. Scattered Factor-Universality of Words

13. Reconstructing Words from Right-Bounded-Block Words

14. On Solving Word Equations Using SAT

15. Matching Patterns with Variables

16. k-Spectra of Weakly-c-Balanced Words

17. On Matching Generalised Repetitive Patterns

18. The Satisfiability of Word Equations: Decidable and Undecidable Theories

19. Detecting One-Variable Patterns

20. Equations Enforcing Repetitions Under Permutations

21. Square-Density Increasing Mappings

22. Prefix-Suffix Square Completion

23. On the Solvability Problem for Restricted Classes of Word Equations

24. Longest Gapped Repeats and Palindromes

25. On Prefix/Suffix-Square Free Words

26. Longest -Gapped Repeat and Palindrome

27. Unary Patterns with Permutations

28. Generalised Lyndon-Schützenberger Equations

29. k-Abelian Pattern Matching

30. Bounded Prefix-Suffix Duplication

31. A Stronger Square Conjecture on Binary Words

32. Discovering Hidden Repetitions in Words

33. Inner Palindromic Closure

34. String Matching with Involutions

35. Fine and Wilf’s Theorem and Pseudo-repetitions

36. The Avoidability of Cubes under Permutations

37. Hairpin Lengthening and Shortening of Regular Languages

38. On Internal Contextual Grammars with Subregular Selection Languages

39. Connecting Partial Words and Regular Languages

40. Periodicity Algorithms for Partial Words

41. k-Local Internal Contextual Grammars

42. On Contextual Grammars with Subregular Selection Languages

43. Deciding Networks of Evolutionary Processors

44. Deciding According to the Shortest Computations

45. On Normal Forms for Networks of Evolutionary Processors

46. Networks of Evolutionary Processors with Subregular Filters

47. Context Insertions

48. Hairpin Lengthening

49. Hard Counting Problems for Partial Words

50. Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof

Catalog

Books, media, physical & digital resources