On path equivalence of nondeterministic finite automata
From MaRDI portal
Publication:1351166
DOI10.1016/0020-0190(96)00039-7zbMath0875.68650MaRDI QIDQ1351166
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00039-7
68Q45: Formal languages and automata
68W10: Parallel algorithms in computer science
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Universality Problem for Unambiguous VASS, Image-binary automata, Trace Refinement in Labelled Markov Decision Processes, Note on the complexity of Las Vegas automata problems
Cites Work
- Space-bounded reducibility among combinatorial problems
- A taxonomy of problems with fast parallel algorithms
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item