On a class of languages recognizable by probabilistic reversible decide-and-halt automata

DOI10.1016/J.TCS.2009.01.042zbMATH Open1163.68023OpenAlexW2011107310MaRDI QIDQ1017410FDOQ1017410

Authors: Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs 

Publication date: 19 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.042

Recommendations

• scientific article; zbMATH DE number 2090013
• Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages
• scientific article
• scientific article; zbMATH DE number 1512863
• One-way probabilistic reversible and quantum one-counter automata.

zbMATH Keywords

probabilistic automataquantum automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• Probabilistic automata
• Title not available (Why is that?)
• Quantum automata and quantum grammars
• Characterizations of 1-Way Quantum Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Permutation automata
• STACS 2004
• On stochastic languages

Cited In (3)

• Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On a class of languages recognizable by probabilistic reversible decide-and-halt automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017410)