Automata theory based on quantum logic: Some characterizations (Q598192)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Automata theory based on quantum logic: Some characterizations	scientific article

Statements

scholarly article

Automata theory based on quantum logic: Some characterizations (English)

Information and Computation

publication date

6 August 2004

zbMATH Keywords

\(l\)-valued automata theory

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ic.2003.11.003

The source as a tool in automata

The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

Logical Reversibility of Computation

Regular languages accepted by quantum automata

Characterizations of 1-Way Quantum Finite Automata

Quantum Complexity Theory

Quantum theory, the Church–Turing principle and the universal quantum computer

Quantum computers.

Quantum automata and quantum grammars

Orthomodular structures as quantum logics. Transl. from the Slovak

Characterization of sequential quantum machines

Quantum pushdown automata

Upper bound on the success probability of separation among quantum states

Non-optimal universal quantum deleting machine

Some general probabilistic quantum cloning and deleting machines

Automata theory based on complete residuated lattice-valued logic

Automata theory based on complete residuated lattice-valued logic. II

Probabilistic automata

Axiom schemes for <i>m</i>-valued propositions calculi

Analog computation via neural networks

A topology for automata: A note

A single quantum cannot be cloned

Automata theory based on quantum logic. II.

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:598192

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q598192&oldid=37907622"