On notions of regularity for data languages
2010 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 411, no 4-5, 702-715 p.Article in journal (Refereed) Published
With motivation from considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for data languages. Recently, such a model, data automata, was introduced. This paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties, and some extensions.
Place, publisher, year, edition, pages
2010. Vol. 411, no 4-5, 702-715 p.
IdentifiersURN: urn:nbn:se:umu:diva-35539DOI: 10.1016/j.tcs.2009.10.009OAI: oai:DiVA.org:umu-35539DiVA: diva2:344984