Pages that link to "Item:Q5958721"
From MaRDI portal
The following pages link to Minimal cover-automata for finite languages (Q5958721):
Displaying 36 items.
- Minimal consistent DFA revisited (Q306711) (← links)
- Learning finite cover automata from queries (Q414872) (← links)
- Asymptotic approximation by regular languages (Q831785) (← 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)
- Inductive synthesis of cover-grammars with the help of ant colony optimization (Q1692068) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Succinct representations of languages by DFA with different levels of reliability (Q1763718) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- Minimal consistent DFA from sample strings (Q2182675) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Testing based on identifiable P systems using cover automata and X-machines (Q2282267) (← links)
- On the cover complexity of finite languages (Q2334605) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Kernel P systems: from modelling to verification and testing (Q2413314) (← links)
- On the existence of regular approximations (Q2465045) (← 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)
- Kernel P Systems Modelling, Testing and Verification - Sorting Case Study (Q2975916) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (Q3637336) (← 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)
- GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012 (Q5495413) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
- COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN (Q5704369) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- A model learning based testing approach for kernel P systems (Q6162072) (← links)
