"On pebble automata for data languages with decidable emptiness problem."

Tony Tan (2010)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2010.03.004

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Tan10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Tan10
Tony Tan:
On pebble automata for data languages with decidable emptiness problem. J. Comput. Syst. Sci. 76(8): 778-791 (2010)

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.