Klaus Sutner
According to our database^{1},
Klaus Sutner
authored at least 47 papers
between 1988 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Abelian Invertible Automata.
Proceedings of the Reversibility and Universality, 2018
2016
Cognitive Tutors Produce Adaptive Online Course: Inaugural Field Trial.
Proceedings of the Intelligent Tutoring Systems  13th International Conference, 2016
2015
Iterating Transducers.
Fundam. Inform., 2015
2014
Iteration of Invertible Transductions.
Int. J. Found. Comput. Sci., 2014
2013
Invertible Transducers, Iteration and Coordinates.
Proceedings of the Implementation and Application of Automata, 2013
Invertible Transductions and Iteration.
Proceedings of the Descriptional Complexity of Formal Systems, 2013
2012
Iterating Inverse Binary Transducers.
Journal of Automata, Languages and Combinatorics, 2012
Computational classification of cellular automata.
Int. J. General Systems, 2012
Preface.
Int. J. Found. Comput. Sci., 2012
Iterating Invertible Binary Transducers.
Proceedings of the Descriptional Complexity of Formal Systems, 2012
2011
Computational processes, observers and Turing incompleteness.
Theor. Comput. Sci., 2011
Stephen L. Bloom 19402010.
Fundam. Inform., 2011
2009
Cellular Automata, Classification of.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009
Model Checking OneDimensional Cellular Automata.
J. Cellular Automata, 2009
Cellular Automata, Decidability and Phasespace.
Proceedings of the Workshop on NonClassical Models for Automata and Applications  NCMA 2009, Wroclaw, Poland, August 31, 2009
2008
Computational Processes and Incompleteness
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008
2005
CDM: Teaching discrete mathematics to computer science majors.
ACM Journal of Educational Resources in Computing, 2005
2004
The complexity of reversible cellular automata.
Theor. Comput. Sci., 2004
Universality and Cellular Automata.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004
2003
Cellular automata and intermediate degrees.
Theor. Comput. Sci., 2003
Reduced Power Automata And Sofic Systems.
Int. J. Found. Comput. Sci., 2003
Almost Periodic Configurations on Linear Cellular Automata.
Fundam. Inform., 2003
The EhrenfeuchtMycielski Sequence.
Proceedings of the Implementation and Application of Automata, 2003
2002
Cellular Automata and Intermediate Reachability Problems.
Fundam. Inform., 2002
Decomposition of Additive Cellular Automata.
Complex Systems, 2002
automata, a Hybrid System for Computational Automata Theory.
Proceedings of the Implementation and Application of Automata, 2002
Reduced Power Automata.
Proceedings of the Implementation and Application of Automata, 2002
2001
The Size of Power Automata.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001
2000
sigmaAutomata and ChebyshevPolynomials.
Theor. Comput. Sci., 2000
1998
Two algorithms for a reachability problem in onedimensional space.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 1998
1997
Linear Cellular Automata and Fischer Automata.
Parallel Computing, 1997
Computing Optimal Assignments for Residual Network Reliability.
Discrete Applied Mathematics, 1997
Exploiting computer algebra systems in computer science courses (panel).
Proceedings of the 28th SIGCSE Technical Symposium on Computer Science Education, 1997, San Jose, California, USA, February 27, 1997
1995
The intractability of the reliable assignment problem in split networks.
Networks, 1995
Preface.
Networks, 1995
On the Computational Complexity of Finite Cellular Automata.
J. Comput. Syst. Sci., 1995
1993
Computing Residual Connectedness Reliability for Restricted Networks.
Discrete Applied Mathematics, 1993
1992
Implementing Finite State Machines.
Proceedings of the Computational Support for Discrete Mathematics, 1992
1991
The Complexity of the Residual Node Connectedness Reliability Problem.
SIAM J. Comput., 1991
De Bruijn Graphs and Linear Cellular Automata.
Complex Systems, 1991
1990
The Ordertype of betaR.E. sets.
J. Symb. Log., 1990
1989
A Note on CulikYu Classes.
Complex Systems, 1989
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989
The Computational Complexity of Cellular Automata.
Proceedings of the Fundamentals of Computation Theory, 1989
1988
Additive Automata On Graphs.
Complex Systems, 1988
On σAutomata.
Complex Systems, 1988
Motion Planning Among Time Dependent Obstacles.
Acta Inf., 1988