Work

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

Year: 2001

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-45678-3_24

Author: Takeshi Koshiba

Institution: Fujitsu (Japan)

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1848837988

FWCI: 0.239

Cites: 17

Cited by: 11

Related to: 10