www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/620

Title: Towards Regular Languages over Infinite Alphabets
Authors: NEVEN, Frank
Schwentick, Thomas
Vianu, Victor
Issue Date: 2001
Publisher: Springer-Verlag GmbH
Citation: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE. p. 560-572
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE, 2136
Abstract: Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble automata, and extensions of first-order logic and monadic second-order logic. For each type of automaton we consider one-way and two-way variants, as well as deterministic, non-deterministic, and alternating control. We investigate the expressiveness and complexity of the automata, their connection to the logics, as well as standard decision problems.
URI: http://hdl.handle.net/1942/620
DOI: 10.1007/3-540-44683-4_49
ISI #: 000179963500049
ISBN: 0302-9743
ISSN: 0302-9743
Category: A1
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A322.74 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.