One-way reversible and quantum finite automata with advice (Q476173): Difference between revisions

Latest revision as of 08:36, 9 July 2024

scientific article; zbMATH DE number 6044370

One-Way Reversible and Quantum Finite Automata with Advice

Language	Label	Description	Also known as
English	One-way reversible and quantum finite automata with advice	scientific article; zbMATH DE number 6044370	One-Way Reversible and Quantum Finite Automata with Advice

Statements

instance of

scholarly article

0 references

title

One-way reversible and quantum finite automata with advice (English)

0 references

One-Way Reversible and Quantum Finite Automata with Advice (English)

0 references

author

Tomoyuki Yamakami

0 references

published in

Information and Computation

0 references

Language and Automata Theory and Applications

0 references

publication date

28 November 2014

0 references

8 June 2012

0 references

full work available at URL

https://arxiv.org/abs/1208.6092

0 references

zbMATH Keywords

reversible finite automaton

0 references

quantum finite automaton

0 references

regular language

0 references

context-free language

0 references

randomized advice

0 references

quantum advice

0 references

rewritable tape

0 references

advice

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Limitations of Quantum Advice and One-Way Communication

0 references

Q2762497

0 references

Dense quantum coding and quantum finite automata

0 references

Inference of Reversible Languages

0 references

Characterizations of 1-Way Quantum Finite Automata

0 references

Automata that take advice

0 references

Amount of nonconstructivity in deterministic finite automata

0 references

Multiple Usage of Random Bits in Finite Automata

0 references

Turing machines that take advice

0 references

Finite Automata with Advice Tapes

0 references

Quantum automata and quantum grammars

0 references

An NP-complete language accepted in linear time by a one-tape Turing machine

0 references

Polynomial time quantum computation with advice

0 references

Implementation and Application of Automata

0 references

An application of quantum finite automata to interactive proof systems

0 references

Quantum information and the PCP theorem

0 references

SOFSEM 2004: Theory and Practice of Computer Science

0 references

Quantum computation with write-only memory

0 references

Pseudorandom generators against advised context-free languages

0 references

The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)

0 references

Immunity and pseudorandomness of context-free languages

0 references

Constant-space quantum interactive proofs against multiple provers

0 references

Identifiers

zbMATH Open document ID

1309.68125

0 references

1351.68144

0 references

DOI

10.1016/j.ic.2014.10.003

0 references

10.1007/978-3-642-28332-1_45

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:476173

@@ Property / cites work @@
+Limitations of Quantum Advice and One-Way Communication
+Normal rank
@@ Property / cites work @@
+Q2762497
@@ Property / cites work: Q2762497 / rank @@
+Normal rank
@@ Property / cites work @@
+Dense quantum coding and quantum finite automata
@@ Property / cites work: Dense quantum coding and quantum finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of 1-Way Quantum Finite Automata
+Normal rank
@@ Property / cites work @@
+Automata that take advice
@@ Property / cites work: Automata that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+Amount of nonconstructivity in deterministic finite automata
+Normal rank
@@ Property / cites work @@
+Multiple Usage of Random Bits in Finite Automata
@@ Property / cites work: Multiple Usage of Random Bits in Finite Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Turing machines that take advice
@@ Property / cites work: Turing machines that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+Finite Automata with Advice Tapes
@@ Property / cites work: Finite Automata with Advice Tapes / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum automata and quantum grammars
@@ Property / cites work: Quantum automata and quantum grammars / rank @@
+Normal rank
@@ Property / cites work @@
+An NP-complete language accepted in linear time by a one-tape Turing machine
+Normal rank
@@ Property / cites work @@
+Polynomial time quantum computation with advice
@@ Property / cites work: Polynomial time quantum computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and Application of Automata
@@ Property / cites work: Implementation and Application of Automata / rank @@
+Normal rank
@@ Property / cites work @@
+An application of quantum finite automata to interactive proof systems
+Normal rank
@@ Property / cites work @@
+Quantum information and the PCP theorem
@@ Property / cites work: Quantum information and the PCP theorem / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2004: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Quantum computation with write-only memory
@@ Property / cites work: Quantum computation with write-only memory / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators against advised context-free languages
+Normal rank
@@ Property / cites work @@
+The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Immunity and pseudorandomness of context-free languages
+Normal rank
@@ Property / cites work @@
+Constant-space quantum interactive proofs against multiple provers
+Normal rank