"On the complexity of reductions by restarting automata."

Martin Plátek, Markéta Lopatková, Dana Pardubská (2014)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2014-08-04

- no documents available
- export record
  dblp key:
  - conf/ncma/PlatekLP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ncma/PlatekLP14
Martin Plátek, Markéta Lopatková, Dana Pardubská:
On the complexity of reductions by restarting automata. NCMA 2014: 207-222

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.