"Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words."

Kord Eickmeyer, Georg Schindling (2025)

> Home

Details and statistics

DOI: 10.1007/978-3-032-01475-7_15

access: closed

type: Conference or Workshop Paper

metadata version: 2025-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dlt/EickmeyerS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/EickmeyerS25
Kord Eickmeyer, Georg Schindling:
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words. DLT 2025: 213-228

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.