"One Alternation Can Be More Powerful Than Randomization in Small and Fast ..."

Kaspars Balodis (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-40164-0_7

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/Balodis13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/Balodis13
Kaspars Balodis:
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata. FCT 2013: 40-47

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.