Some applications of propositional logic to cellular automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F09%3A00380559" target="_blank" >RIV/67985840:_____/09:00380559 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/malq.200810008" target="_blank" >http://dx.doi.org/10.1002/malq.200810008</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/malq.200810008" target="_blank" >10.1002/malq.200810008</a>

Result language
angličtina
Original language name
Some applications of propositional logic to cellular automata
Original language description
In this paper we give a new proof of Richardson's theorem [31]: a global function G(A) of a cellular automaton A is injective if and only if the inverse of G(A) is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton using the method of feasible interpolation from [20]. We also solve two problems regarding complexity of cellular automata formulated by Durand [12].
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/IAA1019401" target="_blank" >IAA1019401: Theories, proofs and computational complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)