"Descriptional Complexity of (Un)ambiguous Finite State Machines and ..."

Markus Holzer, Martin Kutrib (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-15349-5_1

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rp/HolzerK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rp/HolzerK10
Markus Holzer, Martin Kutrib:
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP 2010: 1-23

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.