EUVIMEDEUVIMED entdecken
Crossref

Finite state machines for strings over infinite alphabets

Frank Neven, Thomas Schwentick, Victor Vianu

ACM Transactions on Computational Logic · 2004-07 · 5 (3) · 403-435

DOI: 10.1145/1013560.1013562 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, 2004-07. Verfasst von Frank Neven und 2 weiteren Autor:innen. Die Arbeit wurde bisher 208-mal zitiert (Crossref) und nennt 31 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Neven, F., Schwentick, T., & Vianu, V. (2004). Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic, 5(3), 403-435. https://doi.org/10.1145/1013560.1013562

Vancouver

Neven F, Schwentick T, Vianu V. Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic. 2004;5(3):403-435. doi:10.1145/1013560.1013562

BibTeX
@article{Neven2004,
  author = {Neven, Frank and Schwentick, Thomas and Vianu, Victor},
  title = {Finite state machines for strings over infinite alphabets},
  journal = {ACM Transactions on Computational Logic},
  year = {2004},
  volume = {5},
  number = {3},
  pages = {403--435},
  doi = {10.1145/1013560.1013562}
}
Kostenlos starten →