Minimal cover-automata for finite languages
From MaRDI portal
Publication:5958721
DOI10.1016/S0304-3975(00)00292-9zbMath0984.68099OpenAlexW2037872771WikidataQ59595166 ScholiaQ59595166MaRDI QIDQ5958721
Nicolae Sântean, Sheng Yu, Cezar Campeanu
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00292-9
Related Items (36)
Asymptotic approximation by regular languages ⋮ Minimal consistent DFA revisited ⋮ Hyper-minimisation Made Efficient ⋮ Incremental construction of minimal deterministic finite cover automata ⋮ Finite state based testing of P systems ⋮ Building efficient and compact data structures for simplicial complexes ⋮ Kernel P systems: from modelling to verification and testing ⋮ Minimal consistent DFA from sample strings ⋮ A model learning based testing approach for spiking neural P systems ⋮ More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Reducing Acyclic Cover Transducers ⋮ Inductive synthesis of cover-grammars with the help of ant colony optimization ⋮ Learning finite cover automata from queries ⋮ A model learning based testing approach for kernel P systems ⋮ On the compressibility of finite languages and formal proofs ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton ⋮ NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES ⋮ COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN ⋮ On the existence of regular approximations ⋮ Bounded sequence testing from deterministic finite state machines ⋮ UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION ⋮ Succinct representations of languages by DFA with different levels of reliability ⋮ State complexity of finite partial languages ⋮ Similarity relations and cover automata ⋮ On Testing P Systems ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Testing based on identifiable P systems using cover automata and X-machines ⋮ Computing All ℓ-Cover Automata Fast ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton ⋮ GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012 ⋮ Compressibility of Finite Languages by Grammars ⋮ On the cover complexity of finite languages ⋮ State complexity of finite partial languages ⋮ More on deterministic and nondeterministic finite cover automata
Cites Work
- A class of measures on formal languages
- The state complexities of some basic operations on regular languages
- Automaticity. I: Properties of a measure of descriptional complexity
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimal cover-automata for finite languages
