scientific article; zbMATH DE number 1773088

zbMath0989.68070MaRDI QIDQ4540971

Andrei Păun, Nicolae 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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (8)

Incremental construction of minimal deterministic finite cover automata ⋮ Reducing Acyclic Cover Transducers ⋮ Learning finite cover automata from queries ⋮ Bounded sequence testing from deterministic finite state machines ⋮ On Testing P Systems ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ More on deterministic and nondeterministic finite cover automata

This page was built for publication: