"State Complexity of Operations on Two-Way Deterministic Finite Automata ..."

Michal Kunc, Alexander Okhotin (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22600-7_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dcfs/KuncO11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/KuncO11
Michal Kunc, Alexander Okhotin:
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. DCFS 2011: 222-234

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.