Pages that link to "Item:Q580983"
From MaRDI portal
The following pages link to From regular expressions to deterministic automata (Q580983):
Displaying 43 items.
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- Clocks in dataflow languages (Q1185019) (← links)
- Regular expressions into finite automata (Q1314367) (← 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)
- Passive testing with asynchronous communications and timestamps (Q1656880) (← links)
- Automata for regular expressions with shuffle (Q1706150) (← links)
- Regular expression searching on compressed text (Q1827268) (← links)
- Motif statistics. (Q1853502) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- PuRSUE -- from specification of robotic environments to synthesis of controllers (Q2198133) (← links)
- Functional dependencies on extended relations defined by regular languages (Q2254640) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- A mesh of automata (Q2272980) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Boolean operations and inclusion test for attribute-element constraints (Q2503331) (← links)
- NR‐grep: a fast and flexible pattern‐matching tool (Q2785069) (← 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)
- Clausal Tableaux for Hybrid PDL (Q2825411) (← links)
- Derivative-Based Diagnosis of Regular Expression Ambiguity (Q2830226) (← links)
- Derivatives of Regular Expressions and an Application (Q2891325) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- Hardware Implementations of Finite Automata and Regular Expressions (Q2947405) (← links)
- From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- How expressions can code for automata (Q4680737) (← links)
