arXiv
Open Access
2012
In the Maze of Data Languages
Loris D'Antoni
Abstrak
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the string and tree cases. In this paper we describe and compare the complexity and expressiveness of such models to understand which ones are better candidates as regular models.
Topik & Kata Kunci
Penulis (1)
L
Loris D'Antoni
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2012
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓