Succinctness of two-way probabilistic and quantum finite automata
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2010-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/509/pdf |
| _version_ | 1797270134177398784 |
|---|---|
| author | Abuzer Yakaryilmaz A. C. Cem Say |
| author_facet | Abuzer Yakaryilmaz A. C. Cem Say |
| author_sort | Abuzer Yakaryilmaz |
| collection | DOAJ |
| description | special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications |
| first_indexed | 2024-04-25T01:59:26Z |
| format | Article |
| id | doaj.art-469742187a73449f89bbabf4039d08f6 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:59:26Z |
| publishDate | 2010-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-469742187a73449f89bbabf4039d08f62024-03-07T15:17:05ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502010-01-01Vol. 12 no. 410.46298/dmtcs.509509Succinctness of two-way probabilistic and quantum finite automataAbuzer Yakaryilmaz0A. C. Cem Say1Department of Computer Engineering [Bogazici]Department of Computer Engineering [Bogazici]special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applicationshttps://dmtcs.episciences.org/509/pdfquantum and probabilistic automatasuccinctnessprobability amplification[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Abuzer Yakaryilmaz A. C. Cem Say Succinctness of two-way probabilistic and quantum finite automata Discrete Mathematics & Theoretical Computer Science quantum and probabilistic automata succinctness probability amplification [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Succinctness of two-way probabilistic and quantum finite automata |
| title_full | Succinctness of two-way probabilistic and quantum finite automata |
| title_fullStr | Succinctness of two-way probabilistic and quantum finite automata |
| title_full_unstemmed | Succinctness of two-way probabilistic and quantum finite automata |
| title_short | Succinctness of two-way probabilistic and quantum finite automata |
| title_sort | succinctness of two way probabilistic and quantum finite automata |
| topic | quantum and probabilistic automata succinctness probability amplification [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/509/pdf |
| work_keys_str_mv | AT abuzeryakaryilmaz succinctnessoftwowayprobabilisticandquantumfiniteautomata AT accemsay succinctnessoftwowayprobabilisticandquantumfiniteautomata |