mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Quantum versus probabilistic one-way finite automata with counter
Mälardalen University, Department of Mathematics and Physics.
University of Latvia, Latvia.
University of Latvia, Latvia.
2001 (English)In: SOFSEM 2001: Theory and Practice of Informatics: 28th Conference on Current Trends in Theory and Practice of Informatics Piešt’any, Slovak Republic, November 24 – December 1, 2001 Proceedings, 2001, Vol. 2234, p. 181-190Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2001. Vol. 2234, p. 181-190
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2234
National Category
Mathematics
Identifiers
URN: urn:nbn:se:mdh:diva-2975DOI: 10.1007/3-540-45627-9_15ISBN: 978-3-540-42912-8 (print)OAI: oai:DiVA.org:mdh-2975DiVA, id: diva2:115639
Conference
28th Conference on Current Trends in Theory and Practice of Informatics Piešt’any, Slovak Republic, November 24 – December 1, 2001
Available from: 2008-03-08 Created: 2008-03-08 Last updated: 2015-07-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Bonner, Richard
By organisation
Department of Mathematics and Physics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 72 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf