On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2009.01.042 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2009.01.042 / rank | |||
Normal rank | |||
Latest revision as of 13:05, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a class of languages recognizable by probabilistic reversible decide-and-halt automata |
scientific article |
Statements
On a class of languages recognizable by probabilistic reversible decide-and-halt automata (English)
0 references
19 May 2009
0 references
probabilistic automata
0 references
quantum automata
0 references
