"On the Descriptional Complexity of Finite Automata With Modified ..."

Markus Holzer (2003)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2016-03-17

- no documents available
- export record
  dblp key:
  - conf/dcfs/Holzer03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/Holzer03
Markus Holzer:
On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions. DCFS 2003: 26-41

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.