A lower bound technique for the size of nondeterministic finite automata
type: Item
instance of: scholarly article
title: A lower bound technique for the size of nondeterministic finite automata
zbMATH Open document ID: 0900.68313
DOI: 10.1016/0020-0190(96)00095-6
author: Ian Glaister
author: Jeffrey Shallit
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 983266
zbMATH Keywords: Formal languages
zbMATH Keywords: Nondeterministic finite automata
zbMATH Keywords: Lower bound
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00095-6
OpenAlex ID: W2080108335
cites work: Q4005202
cites work: Q4375814
cites work: Q5592246
cites work: THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
cites work: Minimal NFA Problems are Hard
cites work: On the State Minimization of Nondeterministic Finite Automata
description: scientific article; zbMATH DE number 983266