2012•Information and ComputationOpen access

On the complexity of minimizing probabilistic and quantum automata

Paulo Mateus, Daowen Qiu, Lvzhou Li

Open full text 34 citations

Abstract

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

Open-access reader

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 34 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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: Quantum finite automata, Mobile automaton, Deterministic context-free grammar, Probabilistic logic, Discrete mathematics, Automata theory, Nested word, Quantum cellular automaton

Back to paper search Browse research topics Original source

On the complexity of minimizing probabilistic and quantum automata — Research Paper | ScholarLens