Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
112
Voted
MFCS
2007
Springer
104
views
Theoretical Computer Science
»
more
MFCS 2007
»
Towards a Rice Theorem on Traces of Cellular Automata
15 years 9 months ago
Download
igm.univ-mlv.fr
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of problems over trace subshifts of cellular automata.
Julien Cervelle, Pierre Guillon
Real-time Traffic
Cellular Automaton
|
MFCS 2007
|
Space-time Diagram
|
Trace Subshifts
|
claim paper
Related Content
»
Revisiting the Rice Theorem of Cellular Automata
»
Captive Cellular Automata
»
Intrinsically Universal Cellular Automata
»
Realizability of Concurrent Recursive Programs
more »
Post Info
More Details (n/a)
Added
08 Jun 2010
Updated
08 Jun 2010
Type
Conference
Year
2007
Where
MFCS
Authors
Julien Cervelle, Pierre Guillon
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision