2002•Lecture notes in computer scienceRequires access

The Complexity of Probabilistic versus Quantum Finite Automata

Gatis Midrijānis

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Probabilistic automaton, Deterministic finite automaton, Deterministic automaton, Two-way deterministic finite automaton, Nondeterministic finite automaton, Quantum finite automata, Probabilistic logic, Büchi automaton