The following pages link to (Q5725992):
Displaying 50 items.
- Fuzzy terms (Q277347) (← links)
- Brzozowski type determinization for fuzzy automata (Q279377) (← links)
- On continuous nondeterminism and state minimality (Q283735) (← links)
- A polynomial double reversal minimization algorithm for deterministic finite automata (Q386994) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- Reversal of binary regular languages (Q443743) (← links)
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- Regular languages viewed from a graph-theoretic perspective (Q515689) (← links)
- On the state complexity of reversals of regular languages (Q596099) (← links)
- On equations for regular languages, finite automata, and sequential networks (Q600253) (← links)
- The word problem for \(\omega \)-terms over DA (Q650888) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- NFA reduction algorithms by means of regular inequalities (Q703569) (← links)
- Quantitative simulations by matrices (Q729815) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- Coalgebraic constructions of canonical nondeterministic automata (Q890382) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Transducers for the bidirectional decoding of prefix codes (Q964396) (← links)
- The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- Succinct representation of regular languages by Boolean automata. II (Q1068549) (← links)
- On solving star equations (Q1085619) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- Succinct representation of regular languages by Boolean automata (Q1151754) (← links)
- Unrestricted complementation in language equations over a one-letter alphabet (Q1334656) (← links)
- The size of power automata. (Q1401251) (← links)
- Sorting and doubling techniques for set partitioning and automata minimization problems (Q1575899) (← links)
- Coalgebraic minimization of automata by initiality and finality (Q1744392) (← links)
- On the size complexity of hybrid networks of evolutionary processors (Q1763710) (← links)
- Minimisation of automata (Q2074212) (← links)
- Closure properties of subregular languages under operations (Q2104140) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- A string diagrammatic axiomatisation of finite-state automata (Q2233427) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- A mesh of automata (Q2272980) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Left-handed completeness (Q2286746) (← links)
- The Booleanization of an inverse semigroup (Q2297058) (← links)
- Canonization of max-min fuzzy automata (Q2329102) (← links)
- DFA minimization: double reversal versus split minimization algorithms (Q2342683) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Concatenation-free languages (Q2357107) (← links)
- Theory of átomata (Q2453119) (← links)
- Locally testable languages (Q2554236) (← links)
