Generalized data automata and fixpoint logic

DOI10.4230/LIPICS.FSTTCS.2014.267MaRDI QIDQ2978519zbMATH OpenOpenAlexFDO

Authors Thomas Colcombet, Amaldev Manuel

Publication date 25 April 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2014.267

zbMATH Keywords

data automatadata wordsdecidabilityfixpoint logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Fragments of fixpoint logic on data words
• Feasible automata for two-variable logic with successor on data words
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Safety alternating automata on data words
• Two-variable logic on data words

Cited in

(7)

• Nondeterministic and co-nondeterministic implies deterministic, for data languages
• Automata vs. Logics on Data Words
• scientific article; zbMATH DE number 6109856 (Why is no real title available?)
• A decidable extension of data automata
• scientific article; zbMATH DE number 7559504 (Why is no real title available?)
• Fragments of fixpoint logic on data words
• Improved lower bounds for reachability in vector addition systems

This page was built for publication: Generalized data automata and fixpoint logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978519)