scientific article; zbMATH DE number 6109856

DOI10.4230/LIPICS.CSL.2012.528zbMATH Open1252.68186MaRDI QIDQ4649570FDOQ4649570

Authors: Zhilin Wu 

Publication date: 22 November 2012

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• 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
• A decidable extension of data automata
• On pebble automata for data languages with decidable emptiness problem

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)