Finite state machines for strings over infinite alphabets

By Frank Neven, Thomas Schwentick, Victor Vianu. TOCL, 2004

301 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/862b0045f7656480b42dd93b77b75d1df41945cc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Ranko S. Lazic
2. Stephane Demri

In Computational Theory and Mathematics

1. Ranko S. Lazic
2. Stephane Demri

In Molecular Biology

1. Ranko S. Lazic
2. Stephane Demri

Citations in the corpus

• LTL with the Freeze Quantifier and Register Automata (2006, methodology): “As in [14, 26, 21, 7, 4, 8, 17], elements of D can only be compared for equality, so it is equivalent and simpler to define a data word as a word over Σ”