The following pages link to (Q3086930):
Displaying 14 items.
- The universal fuzzy automaton (Q279373) (← links)
- A polynomial double reversal minimization algorithm for deterministic finite automata (Q386994) (← links)
- Some more algorithms for Conway's universal automaton (Q399502) (← links)
- Coalgebraic constructions of canonical nondeterministic automata (Q890382) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- Minimisation of automata (Q2074212) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Language-theoretic and finite relation models for the (full) Lambek calculus (Q2398205) (← links)
- Theory of átomata (Q2453119) (← links)
- Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus (Q2964014) (← links)
- Some more on the basis finite automaton (Q4981717) (← links)
- Yet another canonical nondeterministic automaton (Q6499548) (← links)
