2012/08/29 by Loris D’Antoni, D'Antoni, Loris
Computer Science · Biochemistry, Genetics and Molecular Biology · #Algorithms and Data Compression #semigroups and automata theory #DNA and Biological Computing
paper · pdf · doi:10.48550/arxiv.1208.5980
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.