scientific article; zbMATH DE number 1142294
From MaRDI portal
Publication:4385510
Cited in
(63)- On the closure of pattern expressions languages under intersection with regular languages
- On the intersection of regex languages with regular languages
- String-matching on ordered alphabets
- A variation on the Boyer-Moore algorithm
- Efficient CRCW-PRAM algorithms for universal substring searching
- Cut and paste
- Dynamic dictionary matching with failure functions
- Speeding up two string-matching algorithms
- On Boyer-Moore automata
- Classes of cost functions for string edit distance
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Matching a set of strings with variable length don't cares
- A characterization of the squares in a Fibonacci string
- Fast pattern matching in indexed texts
- An efficient null-free procedure for deciding regular language membership
- A new regular grammar pattern matching algorithm.
- Squares, cubes, and time-space efficient string searching
- Fast approximate matching of words against a dictionary
- Efficient codon optimization with motif engineering
- Two-dimensional pattern matching against local and regular-like picture languages
- Deterministic regular expressions with back-references
- One-unambiguity of regular expressions with numeric occurrence indicators
- On the semantics of atomic subgroups in practical regular expressions
- Order-preserving matching
- Prefix-free regular languages and pattern matching
- Re-examining regular expressions with backreferences
- On-line string matching algorithms: survey and experimental results
- Document spanners: a formal approach to information extraction
- Synchronized regular expressions
- A polynomial time match test for large classes of extended regular expressions
- Extending regular expressions with homomorphic replacement
- On Extended Regular Expressions
- Extended regular expressions: succinctness and decidability
- Rigorous approximated determinization of weighted automata
- Expressiveness and static analysis of extended conjunctive regular path queries
- Regular languages with variables on graphs
- Proof of Correctness of a Direct Construction of DFA from Regular Expression
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
- Compound Objects Comparators in Application to Similarity Detection and Object Recognition
- A Formal Framework for Complex Event Processing
- Speeding up two string-matching algorithms
- Longest common subsequences
- Abelian repetitions in Sturmian words
- VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION
- Window-accumulated subsequence matching problem is linear
- On the undecidability and descriptional complexity of synchronized regular expressions
- Pumping lemmas can be ``harmful
- How the character comparison order shapes the shift function of on-line pattern matching algorithms
- An algorithm for matching run-length coded strings
- Regular expressions with backreferences and lookaheads capture NLOG
- Regular expressions with backreferences: polynomial-time matching techniques
- Measuring the expressive power of practical regular expressions by classical stacking automata models
- Bounded similarity querying for time-series data
- Reactive automata
- FC-Datalog as a framework for efficient string querying
- Efficient matching of some fundamental regular expressions with backreferences
- On the size of Boyer-Moore automata
- A complete mechanization of correctness of a string-preprocessing algorithm
- A coarse-grained multicomputer algorithm for the detection of repetitions
- A fast algorithm for finding the positions of all squares in a run-length encoded string
- Multiple serial episodes matching
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385510)
