On measuring nondeterminism in regular languages
type: Item
instance of: scholarly article
title: On measuring nondeterminism in regular languages
zbMATH Open document ID: 0698.68068
DOI: 10.1016/0890-5401(90)90053-K
author: Jonathan Goldstine
author: Detlef Wotschke
author: Chandra M. R. Kintala
published in: Information and Computation
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D60
zbMATH DE Number: 4145355
zbMATH Keywords: spectrum of a regular language
zbMATH Keywords: upper bounds
zbMATH Keywords: lower bounds
zbMATH Keywords: computability
zbMATH Keywords: nondeterminism
zbMATH Keywords: finite automaton
MaRDI profile type: Publication
cites work: Limitedness theorem on finite automata with distance functions
cites work: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
cites work: Amounts of nondeterminism in finite automata
cites work: On the topological structure of a finitely generated semigroup of matrices
cites work: Q3309067
description: scientific article; zbMATH DE number 4145355