The following pages link to Follow automata. (Q1426009):
Displaying 50 items.
- An extended framework for passive asynchronous testing (Q347402) (← links)
- Postfix automata (Q476910) (← links)
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← links)
- Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- On typical hesitant fuzzy automata (Q2153652) (← links)
- Location based automata for expressions with shuffle (Q2232263) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- A mesh of automata (Q2272980) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← 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)
- On the average state complexity of partial derivative automata: an analytic combinatorics approach (Q2909097) (← links)
- Conversion of fuzzy automata into fuzzy regular expressions using transitive closure (Q2987857) (← links)
- An Evaluation of Automata Algorithms for String Analysis (Q3075486) (← links)
- Prefix and Right-Partial Derivative Automata (Q3195704) (← links)
- ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED (Q3395137) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
- A New Family of Regular Operators Fitting with the Position Automaton Computation (Q3599111) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- (Q5061515) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- On Average Behaviour of Regular Expressions in Strong Star Normal Form (Q5205036) (← links)
- Computing with relational machines (Q5269008) (← links)
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA (Q5292270) (← links)