scientific article; zbMATH DE number 1773088
From MaRDI portal
Publication:4540971
zbMATH Open0989.68070MaRDI QIDQ4540971FDOQ4540971
N. Sรขntean, Andrei Pฤun, Sheng Yu
Publication date: 28 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2088/20880243
Title of this publication is not available (Why is that?)
Cited In (13)
- 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}\).
- Title not available (Why is that?)
- Learning finite cover automata from queries
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
- Incremental construction of minimal deterministic finite cover automata
- Bounded sequence testing from deterministic finite state machines
- On the Hopcroft's minimization technique for DFA and DFCA
- Reducing Acyclic Cover Transducers
- More on deterministic and nondeterministic finite cover automata
- Minimal cover-automata for finite languages
- Title not available (Why is that?)
- Hopcroftโs Minimization Technique: Queues or Stacks?
- On Testing P Systems
Recommendations
- AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES ๐ ๐
- Title not available (Why is that?) ๐ ๐
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES ๐ ๐
- Minimal cover-automata for finite languages ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Implementation and Application of Automata ๐ ๐
- Incremental construction of minimal deterministic finite cover automata ๐ ๐
- A fast and simple algorithm for constructing minimal acyclic deterministic finite automata ๐ ๐
- Title not available (Why is that?) ๐ ๐
- On the cover complexity of finite languages ๐ ๐
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540971)
