Pages that link to "Item:Q5696954"
From MaRDI portal
The following pages link to A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES (Q5696954):
Displayed 19 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)
- Testing based on identifiable P systems using cover automata and X-machines (Q2282267) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Time window temporal logic (Q2402278) (← links)
- Finite state based testing of P systems (Q2655491) (← links)
- A model learning based testing approach for spiking neural P systems (Q2672640) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- HYPER-MINIMIZATION IN O(n<sup>2</sup>) (Q3395144) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Hyper-Minimization in O(n 2) (Q3602817) (← 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)
- COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN (Q5704369) (← links)
- A model learning based testing approach for kernel P systems (Q6162072) (← links)