On path equivalence of nondeterministic finite automata

Wen-Guey Tzeng*

*Corresponding author for this work

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

Two nondeterministic finite automata (NFAs) are said to be path equivalent if each string is accepted by the two automata via the same number of computation paths. In this paper we show the following. (1) The path equivalence problem for NFAs without λ-cycles is solvable not only in polynomial sequential time but also in O(log2(n)) parallel time using a polynomial number of processors, where n is the total number of states in two NFAs. (2) The path equivalence problem for NFAs with λ-cycles is PSPACE-complete, hence decidable.

Original languageEnglish
Pages (from-to)43-46
Number of pages4
JournalInformation Processing Letters
Volume58
Issue number1
DOIs
StatePublished - 8 Apr 1996

Keywords

  • Algorithms
  • Automaton
  • Computational complexity
  • Path equivalence

Fingerprint Dive into the research topics of 'On path equivalence of nondeterministic finite automata'. Together they form a unique fingerprint.

  • Cite this