"Deciding the Borel Complexity of Regular Tree Languages."

Alessandro Facchini, Henryk Michalewski (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-08019-2_17

access: closed

type: Conference or Workshop Paper

metadata version: 2017-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cie/FacchiniM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cie/FacchiniM14
Alessandro Facchini, Henryk Michalewski:
Deciding the Borel Complexity of Regular Tree Languages. CiE 2014: 163-172

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.