A decidable extension of data automata

MaRDI QIDQ4964723zbMATH OpenFDO

Authors Zhilin Wu

Publication date 3 March 2021

Full work available at URL https://arxiv.org/abs/1106.1235, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2011.9

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45)

Recommendations

• Class counting automata on datawords
• scientific article; zbMATH DE number 6109856
• Weak and nested class memory automata
• Generalized data automata and fixpoint logic
• Walking on data words

Cited in

(5)

• Automata for a decidable subset of duration calculus.
• Class counting automata on datawords
• On temporal logics with data variable quantifications: decidability and complexity
• scientific article; zbMATH DE number 6109856 (Why is no real title available?)
• First order Büchi automata and their application to verification of LTL specifications

This page was built for publication: A decidable extension of data automata

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