Pages that link to "Item:Q3021940"
From MaRDI portal
The following pages link to AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES (Q3021940):
Displayed 16 items.
- Learning finite cover automata from queries (Q414872) (← links)
- Incremental construction of minimal deterministic finite cover automata (Q860858) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Finite state based testing of P systems (Q2655491) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Similarity relations and cover automata (Q4680729) (← links)
- UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION (Q4923276) (← links)
- On Testing P Systems (Q5191169) (← links)
- Computing All ℓ-Cover Automata Fast (Q5200065) (← links)
- BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS (Q5462116) (← links)
- COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES (Q5696949) (← links)
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES (Q5696954) (← links)
- COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN (Q5704369) (← links)