Finite nondeterministic automata: simulation and minimality
type: Item
instance of: scholarly article
title: Finite nondeterministic automata: simulation and minimality
zbMATH Open document ID: 0944.68098
DOI: 10.1016/S0304-3975(98)00221-7
author: Cristian S. Calude
author: Elena Calude
author: Bakhadyr Khoussainov
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 1493359
zbMATH Keywords: finite automata
zbMATH Keywords: nondeterministic automata
MaRDI profile type: Publication
cites work: Q3325046
cites work: Deterministic automata. Simulation, universality and minimality
cites work: Physical versus computational complementarity. I
cites work: Q4953366
cites work: Q3838838
cites work: On the Bound to the Memory of a Sequential Machine
cites work: Q5639639
cites work: Q4864832
cites work: Computational complementarity
cites work: Automata simulating quantum logics
cites work: Q5592246
cites work: Q5533191
cites work: Q3680279
cites work: Automaton partition logic versus quantum logic
cites work: Automaton logic
cites work: Q4284061
cites work: Regular component splittable languages
Wikidata QID: Q127489004
description: scientific article; zbMATH DE number 1493359