Skip to main navigation Skip to search Skip to main content

Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages

Research output: Chapter in Book/Report/Conference proceedingConference paperResearchpeer-review

2 Citations (Scopus)
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Place of PublicationBerlin ; Heidelberg
PublisherSpringer-Verlag
Pages351-363
Volume6907 LNCS
ISBN (Print)9783642229923
Publication statusPublished - 2011

OECD Field of Science

  • 1.2 Computer and Information Sciences

Cite this