scientific article; zbMATH DE number 1502109

From MaRDI portal

Revision as of 07:55, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4503150

Jump to:navigation, search

zbMath0965.68041MaRDI QIDQ4503150

Martin Kappes

Publication date: 4 September 2000

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

zbMATH Keywords

descriptional complexity of finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Converting finite width AFAs to nondeterministic and universal finite automata ⋮ Extremal minimality conditions on automata ⋮ Minimizing finite automata is computationally hard ⋮ Optimal simulation of self-verifying automata by deterministic automata ⋮ Language operations with regular expressions of polynomial size ⋮ Descriptional complexity of regular languages

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4503150&oldid=18594992"