Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

info@nobleid.org

About Fund our work FAQ Developers Terms Policy Persistence & Resolver Service Policy

Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited | NobleID

v1

Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited

Hellis Tamm, Brink van der Merwe

HT

Hellis Tamm

NobleIDNI2P05W35R65S81

Type:Journal Article

Claim Your Authorship

Sign in to see the full record

Creating an account is free.

Create an account

For data access, contact info@nobleid.org.