scientific article; zbMATH DE number 1962773

zbMath1033.68064MaRDI QIDQ4418606

Heiko Körner

Publication date: 11 August 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2608/26080117.htm

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 (9)

Hyper-minimisation Made Efficient ⋮ Time window temporal logic ⋮ Kernel P systems: from modelling to verification and testing ⋮ A model learning based testing approach for spiking neural P systems ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ Bounded sequence testing from deterministic finite state machines ⋮ On Testing P Systems ⋮ Testing based on identifiable P systems using cover automata and X-machines ⋮ More on deterministic and nondeterministic finite cover automata

This page was built for publication: