On path equivalence of nondeterministic finite automata
type: Item
instance of: scholarly article
title: On path equivalence of nondeterministic finite automata
zbMATH Open document ID: 0875.68650
DOI: 10.1016/0020-0190(96)00039-7
author: Wen-Guey Tzeng
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 984293
zbMATH Keywords: Algorithms
zbMATH Keywords: Computational complexity
zbMATH Keywords: Path equivalence
zbMATH Keywords: Automaton
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00039-7
OpenAlex ID: W2012572971
cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Q5592246
cites work: Q3742714
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q5606985
cites work: Q3992568
cites work: Q5643915
cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
cites work: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
description: scientific article; zbMATH DE number 984293