The following pages link to STACS 2004 (Q5309690):
Displaying 4 items.
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- On language varieties without Boolean operations (Q2232259) (← links)
