scientific article; zbMATH DE number 1142294
From MaRDI portal
Publication:4385510
zbMath0900.68249MaRDI QIDQ4385510
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (57)
A new regular grammar pattern matching algorithm. ⋮ Dynamic dictionary matching with failure functions ⋮ Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices ⋮ Speeding up two string-matching algorithms ⋮ On Boyer-Moore automata ⋮ 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 ⋮ One-unambiguity of regular expressions with numeric occurrence indicators ⋮ Multiple serial episodes matching ⋮ Compound Objects Comparators in Application to Similarity Detection and Object Recognition ⋮ Squares, cubes, and time-space efficient string searching ⋮ Fast approximate matching of words against a dictionary ⋮ Abelian Repetitions in Sturmian Words ⋮ Classes of cost functions for string edit distance ⋮ Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ On the semantics of atomic subgroups in practical regular expressions ⋮ Extended regular expressions: succinctness and decidability ⋮ Rigorous approximated determinization of weighted automata ⋮ Expressiveness and static analysis of extended conjunctive regular path queries ⋮ Longest common subsequences ⋮ Matching a set of strings with variable length don't cares ⋮ A characterization of the squares in a Fibonacci string ⋮ Efficient codon optimization with motif engineering ⋮ Regular languages with variables on graphs ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Order-preserving matching ⋮ Re-examining regular expressions with backreferences ⋮ On-line string matching algorithms: survey and experimental results ⋮ VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION ⋮ How the character comparison order shapes the shift function of on-line pattern matching algorithms ⋮ Prefix-free regular languages and pattern matching ⋮ String-matching on ordered alphabets ⋮ A variation on the Boyer-Moore algorithm ⋮ Extending regular expressions with homomorphic replacement ⋮ An algorithm for matching run-length coded strings ⋮ Proof of Correctness of a Direct Construction of DFA from Regular Expression ⋮ Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time ⋮ Efficient CRCW-PRAM algorithms for universal substring searching ⋮ Bounded similarity querying for time-series data ⋮ Reactive automata ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms ⋮ Two-dimensional pattern matching against local and regular-like picture languages ⋮ Window-accumulated subsequence matching problem is linear ⋮ Document Spanners ⋮ On the size of Boyer-Moore automata ⋮ On Extended Regular Expressions ⋮ A Polynomial Time Match Test for Large Classes of Extended Regular Expressions ⋮ On the closure of pattern expressions languages under intersection with regular languages ⋮ On the intersection of regex languages with regular languages ⋮ A Formal Framework for Complex Event Processing ⋮ Speeding up two string-matching algorithms ⋮ Fast pattern matching in indexed texts ⋮ Deterministic regular expressions with back-references ⋮ Synchronized Regular Expressions ⋮ An efficient null-free procedure for deciding regular language membership ⋮ Cut and paste ⋮ A complete mechanization of correctness of a string-preprocessing algorithm
This page was built for publication:
