The following pages link to (Q4045961):
Displaying 50 items.
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- The state complexity of random DFAs (Q338393) (← links)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Fast brief practical DFA minimization (Q437674) (← links)
- Extremal minimality conditions on automata (Q441884) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- On bisimulations for description logics (Q527171) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
- The word problem for \(\omega \)-terms over DA (Q650888) (← links)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- NFA reduction algorithms by means of regular inequalities (Q703569) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- In and out of equilibrium. I: Evolution of strategies in repeated games with discounting. (Q899680) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Optimal state-space lumping in Markov chains (Q1014448) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- Minimizing deterministic weighted tree automata (Q1041045) (← links)
- Canonical finite state machines for distributed systems (Q1044846) (← links)
- A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- Efficient minimization of homogeneous FSMs for fault diagnosis (Q1129532) (← links)
- Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- Effective subdirect decomposition: A case study (Q1193629) (← links)
- Efficient simplicity testing of automata (Q1193902) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- Identification of function distinguishable languages. (Q1401186) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Follow automata. (Q1426009) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
- Coalgebraic minimization of automata by initiality and finality (Q1744392) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Minimal length test vectors for multiple-fault detection (Q1826631) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
