Pages that link to "Item:Q5549415"
From MaRDI portal
The following pages link to Programming Techniques: Regular expression search algorithm (Q5549415):
Displaying 50 items.
- Regular languages with variables on graphs (Q418127) (← links)
- Translating regular expression matching into transducers (Q420836) (← links)
- Probabilistic grammars and languages (Q438593) (← links)
- String matching with variable length gaps (Q442239) (← links)
- Postfix automata (Q476910) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- A comment on ``Construction of fuzzy automata from fuzzy regular expressions'' (Q529060) (← links)
- Fast searching in packed strings (Q533408) (← links)
- From regular expressions to deterministic automata (Q580983) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825) (← links)
- On two-dimensional pattern-matching languages and their decision problems (Q1093378) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- Approximate matching of regular expressions (Q1119025) (← links)
- AUTOMATE, a computing package for automata and finite semigroups (Q1186737) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- The validation of SGML content models (Q1370524) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- Fast pattern matching in indexed texts (Q1566727) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
- Exact matching of RNA secondary structure patterns (Q1781989) (← links)
- Visibly linear dynamic logic (Q1786616) (← links)
- Regular expression searching on compressed text (Q1827268) (← links)
- On the size of partial derivatives and the word membership problem (Q2041687) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- Memoized regular expressions (Q2117661) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- Formalising and implementing Boost POSIX regular expression matching (Q2220787) (← links)
- A string diagrammatic axiomatisation of finite-state automata (Q2233427) (← links)
- A mesh of automata (Q2272980) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- On the semantics of regular expression parsing in the wild (Q2357106) (← links)