The following pages link to (Q4540971):
Displaying 11 items.
- Learning finite cover automata from queries (Q414872) (← links)
- Incremental construction of minimal deterministic finite cover automata (Q860858) (← links)
- Bounded sequence testing from deterministic finite state machines (Q964395) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\). (Q1853563) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- An algorithm for the decomposition of finite languages (Q3577905) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- On Testing P Systems (Q5191169) (← links)
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES (Q5696954) (← links)
