Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Exponentially more concise quantum recognition of non-RMM regular languages
HTML
PDF
Details
Locations
Year:
2014
Type:
article
Source:
Journal of Computer and System Sciences
DOI:
10.1016/j.jcss.2014.06.008
Authors:
Daowen Qiu,
Lvzhou Li,
Paulo Mateus,
Amilcar Sernadas
Institutions:
University of Lisbon,
Sun Yat-sen University,
Instituto de Telecomunicações,
Instituto Superior Técnico
Language:
English
Topic:
semigroups and automata theory
Subfield:
Computational Theory and Mathematics
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
regular languages,
language identification,
bounded error,
automaton equivalence,
state minimization,
quantum automata
show all 6
Open Access status:
bronze
Funders:
Natural Science Foundation of Guangdong Province,
Fundação para a Ciência e a Tecnologia,
Fundamental Research Funds for the Central Universities,
Specialized Research Fund for the Doctoral Program of Higher Education of China
Awards:
G1321481124,
QSec: Segurança Quântica,
G1933466756,
G6577247595,
Matemática Aplicada: de sistemas dinâmicos a criptografia,
G8435013549
show all 6
OpenAlex ID:
W2963315980
FWCI:
3.159
Cites:
90
Cited by:
30
Related to:
9