scientific article; zbMATH DE number 1773088

MaRDI QIDQ4540971zbMATH OpenFDO

Authors Andrei Păun, N. Sântean, Sheng Yu

Publication date 28 July 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2088/20880243

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• scientific article; zbMATH DE number 1962773
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages
• scientific article; zbMATH DE number 1452982
• 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
• scientific article; zbMATH DE number 2081054
• On the cover complexity of finite languages

Cited in

(18)

• An algorithm for the decomposition of finite languages
• Bounded sequence testing from deterministic finite state machines
• Minimal cover-automata for finite languages
• Reducing Acyclic Cover Transducers
• Learning finite cover automata from queries
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• On the Hopcroft's minimization technique for DFA and DFCA
• Incremental construction of minimal deterministic finite cover automata
• 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}\).
• Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• On Testing P Systems
• More on deterministic and nondeterministic finite cover automata
• scientific article; zbMATH DE number 1452982 (Why is no real title available?)
• Hopcroft’s Minimization Technique: Queues or Stacks?
• scientific article; zbMATH DE number 1962773 (Why is no real title available?)
• Implementation and Application of Automata
• Computing all \(\ell \)-cover automata fast

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)