Follow automata.
From MaRDI portal
Publication:1426009
DOI10.1016/S0890-5401(03)00090-7zbMath1059.68063OpenAlexW2912608078MaRDI QIDQ1426009
Publication date: 14 March 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00090-7
Nondeterministic finite automataPartial derivativesRegular expressions\(\varepsilon\)-EliminationQuotientsRight-invariant equivalences
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Information storage and retrieval of data (68P20) Descriptive complexity and finite models (68Q19)
Related Items
Derivatives of Regular Expressions and an Application ⋮ NORMALIZED EXPRESSIONS AND FINITE AUTOMATA ⋮ THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS ⋮ ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH ⋮ Minimizing nfa's and regular expressions ⋮ On typical hesitant fuzzy automata ⋮ An extended framework for passive asynchronous testing ⋮ Prefix and Right-Partial Derivative Automata ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Finite Automata, Digraph Connectivity, and Regular Expression Size ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ A faster algorithm for finding shortest substring matches of a regular expression ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Provably Shorter Regular Expressions from Deterministic Finite Automata ⋮ Reducing NFAs by invariant equivalences. ⋮ Conversion of fuzzy automata into fuzzy regular expressions using transitive closure ⋮ Space-Efficient Representations for Glushkov Automata ⋮ Postfix automata ⋮ Location based automata for expressions with shuffle ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ Unnamed Item ⋮ PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Derivatives and Finite Automata of Expressions in Star Normal Form ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Language operations with regular expressions of polynomial size ⋮ A mesh of automata ⋮ Multi-tilde-bar expressions and their automata ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ From regular expressions to smaller NFAs ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ Antimirov and Mosses’s Rewrite System Revisited ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ Reduction of fuzzy automata by means of fuzzy quasi-orders ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Compact representations of automata for regular expression matching ⋮ An Evaluation of Automata Algorithms for String Analysis ⋮ An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ Position Automaton Construction for Regular Expressions with Intersection ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ Small Extended Expressions for Acyclic Automata ⋮ ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED ⋮ Automata and rational expressions ⋮ Descriptional complexity of regular languages ⋮ Enumerating regular expressions and their languages ⋮ The Bottom-Up Position Tree Automaton and the Father Automaton ⋮ Deciding Kleene algebra terms equivalence in Coq ⋮ Computing with relational machines ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
Cites Work
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- From regular expressions to DFA's using compressed NFA's
- THE ABSTRACT THEORY OF AUTOMATA
- Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
