Emptiness is decidable for asynchronous cellular machines

DOI10.1007/3-540-44618-4_38MaRDI QIDQ4536626zbMATH OpenFDO

Authors Dietrich Kuske

Publication date 28 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44618-4_38

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cellular automata (computational aspects) (68Q80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Asynchronous cellular automata and asynchronous automata for pomsets
• Fundamentals of Computation Theory
• Asynchronous cellular automata for pomsets
• Asynchronous automata versus asynchronous cellular automata
• Asynchronous mappings and asynchronous cellular automata

Cited in

(3)

• Emptiness problems for distributed automata
• Theories of orders on the set of words
• Emptiness problems for distributed automata

This page was built for publication: Emptiness is decidable for asynchronous cellular machines

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