Weighted asynchronous cellular automata
From MaRDI portal
Publication:1022595
DOI10.1016/j.tcs.2006.11.031zbMath1164.68023OpenAlexW1994100944MaRDI QIDQ1022595
Publication date: 22 June 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.031
Related Items (3)
Realizability of concurrent recursive programs ⋮ Realizability of Concurrent Recursive Programs ⋮ Models for quantitative distributed systems and multi-valued logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asynchronous mappings and asynchronous cellular automata
- Combinatorics on traces
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- On the definition of a family of automata
- Constructing Exponential-Size Deterministic Zielonka Automata
- Notes on finite asynchronous automata
- Weighted Asynchronous Cellular Automata
This page was built for publication: Weighted asynchronous cellular automata