Equivalence problem of non-deterministic finite automata
type: Item
instance of: scholarly article
title: Equivalence problem of non-deterministic finite automata
zbMATH Open document ID: 0401.68028
DOI: 10.1016/0022-0000(79)90048-5
published in: Journal of Computer and System Sciences
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3622947
zbMATH Keywords: Equivalence Problem of Nondeterministic Finite Automata
zbMATH Keywords: Complexity
author: Akihiro Nozaki
MaRDI profile type: Publication
full work available at URL: 0022-0000(79)90048-5
OpenAlex ID: W1998090528
cites work: Q5681000
cites work: Q4079524
cites work: Multiple-entry finite automata
cites work: Q3239817
cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
description: scientific article; zbMATH DE number 3622947