"Checking in polynomial time whether or not a regular tree language is ..."

Sebastian Maneth, Helmut Seidl (2024)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2023.106449

access: open

type: Journal Article

metadata version: 2024-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ipl/ManethS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ManethS24
Sebastian Maneth, Helmut Seidl:
Checking in polynomial time whether or not a regular tree language is deterministic top-down. Inf. Process. Lett. 184: 106449 (2024)

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.