Algebraic Theory of Automata Networks

DOI10.1137/1.9780898718492MaRDI QIDQ4677770zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

algebraic interpretationautomata networks

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 1270383
• scientific article; zbMATH DE number 177522
• scientific article; zbMATH DE number 1482700
• Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985)
• scientific article; zbMATH DE number 3976344

Cited in

(19)

• Commutative automata networks
• More on the descriptional complexity of products of finite automata
• On the descriptional complexity of the direct product of finite automata
• Algebraic approach to the analysis of automaton systems of interconnected graphs with simple links
• Complete simulation of automata networks
• Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions
• The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set.
• Automata networks without any Letichevsky criteria
• scientific article; zbMATH DE number 177522 (Why is no real title available?)
• scientific article; zbMATH DE number 1270383 (Why is no real title available?)
• Properties of hash functions based on Gluškov product of automata
• Amalgamated free product in terms of automata constructions
• scientific article; zbMATH DE number 3248552 (Why is no real title available?)
• A finite-automaton based stream cipher as a quasigroup based cipher
• 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.
• More on the descriptional complexity of products of finite automata
• On \(\alpha _{2} - \nu _{2}\)-products of automata

This page was built for publication: Algebraic Theory of Automata Networks

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