scientific article; zbMATH DE number 1948494

zbMath1015.68120MaRDI QIDQ4412107

Henry N. Adorna

Publication date: 13 July 2003

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes ⋮ On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

This page was built for publication: