scientific article; zbMATH DE number 6109856

DOI10.4230/LIPICS.CSL.2012.528MaRDI QIDQ4649570zbMATH OpenFDO

Authors Zhilin Wu

Publication date 22 November 2012

zbMATH Keywords

data automataPresburger arithmeticcommutative regular languagesexistential monadic second-order logicBüchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Commutative automata networks
• Data multi-pushdown automata
• Generalized data automata and fixpoint logic
• A decidable extension of data automata
• scientific article; zbMATH DE number 2050929
• Commutative cellular automata
• Representations of commutative asynchronous automata
• Automata algebras
• Class counting automata on datawords

Cited in

(8)

• On pebble automata for data languages with decidable emptiness problem
• A decidable extension of data automata
• Weak and nested class memory automata
• Counting Multiplicity over Infinite Alphabets
• On temporal logics with data variable quantifications: decidability and complexity
• Walking on data words
• Class counting automata on datawords
• Feasible automata for two-variable logic with successor on data words

This page was built for publication:

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