"Better Complexity Bounds for Cost Register Automata."

Eric Allender, Andreas Krebs, Pierre McKenzie (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2017.24

access: open

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/AllenderKM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/AllenderKM17
Eric Allender, Andreas Krebs, Pierre McKenzie:
Better Complexity Bounds for Cost Register Automata. MFCS 2017: 24:1-24:14

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.