@article{NevenSchwentickVianu:TOCL:2004,
    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, nondeterministic, and alternating control. We investigate the expressiveness and complexity of the automata and their connection to the logics, as well as standard decision problems. Some of our results answer open questions of Kaminski and Francez on register automata.},
    Address = {New York, NY, USA},
    Author = {Neven, Frank and Schwentick, Thomas and Vianu, Victor},
    File = {Finite State Machines for Strings over Infinite Alphabets - 10.1.1.130.3039.pdf},
    ISSN = {1529-3785},
    Journal = {ACM Trans. Comput. Logic},
    Keywords = {XML, registers, expressiveness, Automata, monadic second-order logic, first-order logic, pebbles, infinite alphabets},
    Month = {July},
    Number = {3},
    Pages = {403--435},
    Publisher = {Association for Computing Machinery},
    Title = {Finite State Machines for Strings over Infinite Alphabets},
    URL = {https://doi.org/10.1145/1013560.1013562},
    Volume = {5},
    Year = {2004},
    bdsk-url-1 = {https://doi.org/10.1145/1013560.1013562},
    date-added = {2021-04-06 14:31:54 +0200},
    date-modified = {2021-04-06 14:32:15 +0200},
    file-2 = {Finite State Machines for Strings over Infinite Alphabets - download.pdf},
    issue_date = {July 2004},
    numpages = {33},
    doi = {10.1145/1013560.1013562}
}

@article{NevenSchwentickVianu:TOCL:2004, 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, nondeterministic, and alternating control. We investigate the expressiveness and complexity of the automata and their connection to the logics, as well as standard decision problems. Some of our results answer open questions of Kaminski and Francez on register automata.}, Address = {New York, NY, USA}, Author = {Neven, Frank and Schwentick, Thomas and Vianu, Victor}, File = {Finite State Machines for Strings over Infinite Alphabets - 10.1.1.130.3039.pdf}, ISSN = {1529-3785}, Journal = {ACM Trans. Comput. Logic}, Keywords = {XML, registers, expressiveness, Automata, monadic second-order logic, first-order logic, pebbles, infinite alphabets}, Month = {July}, Number = {3}, Pages = {403--435}, Publisher = {Association for Computing Machinery}, Title = {Finite State Machines for Strings over Infinite Alphabets}, URL = {https://doi.org/10.1145/1013560.1013562}, Volume = {5}, Year = {2004}, bdsk-url-1 = {https://doi.org/10.1145/1013560.1013562}, date-added = {2021-04-06 14:31:54 +0200}, date-modified = {2021-04-06 14:32:15 +0200}, file-2 = {Finite State Machines for Strings over Infinite Alphabets - download.pdf}, issue_date = {July 2004}, numpages = {33}, doi = {10.1145/1013560.1013562} }