Effective theories for circuits and automata

DOI10.1063/1.3640747zbMath1317.68094arXiv1106.5778OpenAlexW2044660636WikidataQ51525584 ScholiaQ51525584MaRDI QIDQ5264344

Simon DeDeo

Publication date: 27 July 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.5778

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analytic circuit theory (94C05)

Related Items (1)

Bootstrap methods for the empirical study of decision-making and information flows in social systems

Cites Work

• Unnamed Item
• Unnamed Item
• A decomposition theorem for probabilistic transition systems
• The renormalisation group and effective field theories.
• On the Krohn-Rhodes Cascaded Decomposition Theorem
• Invariance of complexity measures for networks with unreliable gates
• Function Algebras on Finite Sets

This page was built for publication: Effective theories for circuits and automata