"Strongly Unambiguous Büchi Automata Are Polynomially Predictable With ..."

Dana Angluin, Timos Antonopoulos, Dana Fisman (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CSL.2020.8

access: open

type: Conference or Workshop Paper

metadata version: 2020-01-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/csl/AngluinAF20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/AngluinAF20
Dana Angluin, Timos Antonopoulos, Dana Fisman:
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. CSL 2020: 8:1-8:17

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.