Algebraic Theory of Automata Networks
From MaRDI portal
Publication:4677770
DOI10.1137/1.9780898718492zbMath1070.68095OpenAlexW4232363786MaRDI QIDQ4677770
Pál Dömösi, Chrystopher L. Nehaniv
Publication date: 12 May 2005
Full work available at URL: https://doi.org/10.1137/1.9780898718492
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (12)
The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set. ⋮ Amalgamated free product in terms of automata constructions ⋮ Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Simple chain automaton random number generator for IoT devices ⋮ Finite state wreath powers of transformation semigroups. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complete simulation of automata networks ⋮ On \(\alpha _{2} - \nu _{2}\)-products of automata ⋮ More on the descriptional complexity of products of finite automata ⋮ On the descriptional complexity of the direct product of finite automata
This page was built for publication: Algebraic Theory of Automata Networks
