Conference item icon

Conference item

Automata vs. Logics on Data Words

Abstract:

 

The relationship between automata and logics has been in- vestigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is definable in first-order logic with label tests and the order relation, and for first-order logic with the successor relation. In recent years, there has been much interest in lan- guages over an infinite alphabet. Kaminski and Francez introduced a class of automata called finite memory automata (FMA), that repr...

Expand abstract

Actions


Access Document


Files:

Authors


Publication date:
2010-01-01
URN:
uuid:5ee6b0a0-2bb8-451a-8a11-8b7c00a11404
Local pid:
cs:3616

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP