Orbits of Abelian Automaton Groups. | 0 | 0.34 | 2019 |
Cognitive Tutors Produce Adaptive Online Course: Inaugural Field Trial. | 0 | 0.34 | 2016 |
Invertible Transductions and Iteration. | 0 | 0.34 | 2013 |
Invertible transducers, iteration and coordinates | 1 | 0.36 | 2013 |
Iterating Inverse Binary Transducers. | 2 | 0.40 | 2012 |
Computational Classification Of Cellular Automata | 6 | 0.56 | 2012 |
Computational processes, observers and Turing incompleteness | 2 | 0.43 | 2011 |
Stephen L. Bloom 1940-2010 | 0 | 0.34 | 2011 |
Cellular Automata, Decidability and Phasespace | 2 | 0.40 | 2010 |
Model Checking One-Dimensional Cellular Automata. | 5 | 0.61 | 2009 |
Computational Processes And Incompleteness | 0 | 0.34 | 2008 |
CDM: Teaching discrete mathematics to computer science majors | 2 | 0.65 | 2005 |
Almost periodic configurations on linear cellular automata | 6 | 0.58 | 2003 |
Reduced Power Automata And Sofic Systems | 0 | 0.34 | 2003 |
The Ehrenfeucht-Mycielski sequence | 3 | 0.59 | 2003 |
Reduced power automata | 0 | 0.34 | 2002 |
automata: a hybrid system for computational automata theory | 4 | 0.82 | 2002 |
The Size of Power Automata | 7 | 0.87 | 2001 |
&sgr;-Automata and Chebyshev-polynomials | 8 | 0.95 | 2000 |
Exploiting computer algebra systems in computer science courses (panel) | 1 | 0.48 | 1997 |
Linear cellular automata and Fischer automata | 10 | 1.16 | 1997 |
The Intractability Of The Reliable Assignment Problem In Split Networks | 0 | 0.34 | 1995 |
On the computational complexity of finite cellular automata | 36 | 2.03 | 1995 |
Implementing finite state machines | 6 | 1.68 | 1992 |
De Bruijn Graphs and Linear Cellular Automata. | 4 | 0.56 | 1991 |
The Ordertype Of Beta-Re Sets | 0 | 0.34 | 1990 |
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets | 0 | 0.34 | 1989 |
A Note on Culik-Yu Classes. | 1 | 0.44 | 1989 |
The Computational Complexity of Cellular Automata | 2 | 0.52 | 1989 |
Additive automata on graphs | 11 | 1.61 | 1988 |
On σ-Automata. | 0 | 0.34 | 1988 |