Pages that link to "Item:Q1190464"
From MaRDI portal
The following pages link to Minimisation of acyclic deterministic automata in linear time (Q1190464):
Displaying 45 items.
- Sampling different kinds of acyclic automata using Markov chains (Q442144) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- Acyclic networks maximizing the printing complexity (Q703493) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Fast equation automaton computation (Q1018095) (← links)
- Optimal insertion in deterministic DAWGs (Q1399983) (← links)
- INTEX: An FST toolbox (Q1575904) (← links)
- The design principles of a weighted finite-state transducer library (Q1575905) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Extending greedy feature selection algorithms to multiple solutions (Q2036770) (← links)
- Minimisation of automata (Q2074212) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Average case analysis of Moore's state minimization algorithm (Q2429348) (← links)
- Parsing with a finite dictionary (Q2484450) (← links)
- Exact enumeration of acyclic deterministic automata (Q2489949) (← links)
- Polynomial time multiplication and normal forms in free bands (Q2693634) (← links)
- How to squeeze a lexicon (Q2783368) (← links)
- Enumeration of minimal acyclic automata via generalized parking functions (Q2803338) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- On-line construction of a small automaton for a finite set of words (Q2909196) (← links)
- A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644) (← links)
- EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA (Q3526533) (← links)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Running Time Complexity of Printing an Acyclic Automaton (Q3559778) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- Random Generation of Deterministic Acyclic Automata Using Markov Chains (Q5200053) (← links)
- Epichristoffel Words and Minimization of Moore Automata (Q5259268) (← links)
- Boosting over non-deterministic ZDDs (Q5919322) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Block languages and their bitmap representations (Q6666792) (← links)
