The following pages link to (Q4848749):
Displaying 25 items.
- Brzozowski type determinization for fuzzy automata (Q279377) (← links)
- Improved and self-tuned occurrence heuristics (Q405578) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Incremental construction of minimal deterministic finite cover automata (Q860858) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- Pseudo-minimal transducer (Q1575902) (← links)
- Coalgebraic minimization of automata by initiality and finality (Q1744392) (← links)
- A new regular grammar pattern matching algorithm. (Q1874408) (← links)
- Aggregation-based minimization of finite state automata (Q2035006) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Automata for solid codes (Q2235761) (← links)
- Theory of átomata (Q2453119) (← links)
- How to squeeze a lexicon (Q2783368) (← links)
- Five Determinisation Algorithms (Q3602811) (← links)
- Towards a Taxonomy for ECFG and RRPG Parsing (Q3618599) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- (Q5003077) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)
- Minimization of Finite State Automata Through Partition Aggregation (Q5738999) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)
