"The emptiness problem for tree automata with at least one global ..."

Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko (2017)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2016.09.007

access: closed

type: Journal Article

metadata version: 2017-12-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/HeamHK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/HeamHK17
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett. 118: 6-9 (2017)

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.