Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Finite state machines for strings over infinite alphabets

Finite state machines for strings over infinite alphabets 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Finite state machines for strings over infinite alphabets

Download PDF
33 pages

Loading next page...
 
/lp/association-for-computing-machinery/finite-state-machines-for-strings-over-infinite-alphabets-KZNE3WkHYF
Publisher
Association for Computing Machinery
Copyright
Copyright © 2004 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/1013560.1013562
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery

Published: Jul 1, 2004

There are no references for this article.