Pages that link to "Item:Q1314367"
From MaRDI portal
The following pages link to Regular expressions into finite automata (Q1314367):
Displaying 50 items.
- Postfix automata (Q476910) (← links)
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Succinctness of pattern-based schema languages for XML (Q532368) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Streaming tree automata (Q975511) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Fast equation automaton computation (Q1018095) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- Regular expression for a language without empty word (Q1365943) (← links)
- The validation of SGML content models (Q1370524) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← 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)
- The inclusion problem for regular expressions (Q1757837) (← links)
- Motif statistics. (Q1853502) (← links)
- SGML and XML document grammars and exceptions (Q1854453) (← links)
- Valuations, regular expressions, and fractal geometry (Q1908904) (← 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)
- Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- Memoized regular expressions (Q2117661) (← links)
- Efficient enumeration of regular expressions for faster regular expression synthesis (Q2117664) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Location based automata for expressions with shuffle (Q2232263) (← links)
- A mesh of automata (Q2272980) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Path constraints in semistructured data (Q2456353) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- Position Automaton Construction for Regular Expressions with Intersection (Q2817375) (← links)
- Derivatives of Regular Expressions and an Application (Q2891325) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS (Q3021941) (← links)
