Klaus Sutner

According to our database, Klaus Sutner authored at least 48 papers between 1988 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Orbits of Abelian Automaton Groups.

Tim Becker, Klaus Sutner

Proceedings of the Language and Automata Theory and Applications, 2019

2018

Abelian Invertible Automata.

Klaus Sutner

Proceedings of the Reversibility and Universality, 2018

2016

Cognitive Tutors Produce Adaptive Online Course: Inaugural Field Trial.

Noboru Matsuda, Martin Van Velsen, Nikolaos Barbalios, Shuqiong Lin, Hardik Vasa, Roya Hosseini, Klaus Sutner, Norman L. Bier

Proceedings of the Intelligent Tutoring Systems - 13th International Conference, 2016

2015

Iterating Transducers.

Klaus Sutner

Fundam. Informaticae, 2015

2014

Iteration of Invertible Transductions.

Klaus Sutner

Int. J. Found. Comput. Sci., 2014

2013

Invertible Transducers, Iteration and Coordinates.

Klaus Sutner

Proceedings of the Implementation and Application of Automata, 2013

Invertible Transductions and Iteration.

Klaus Sutner

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Iterating Inverse Binary Transducers.

Klaus Sutner, Kevin Lewi

J. Autom. Lang. Comb., 2012

Computational classification of cellular automata.

Klaus Sutner

Int. J. Gen. Syst., 2012

Preface.

Jérôme Durand-Lose, Maurice Margenstern, Klaus Sutner

Int. J. Found. Comput. Sci., 2012

Iterating Invertible Binary Transducers.

Klaus Sutner, Kevin Lewi

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011

Computational processes, observers and Turing incompleteness.

Klaus Sutner

Theor. Comput. Sci., 2011

Stephen L. Bloom 1940-2010.

Zoltán Ésik, Klaus Sutner

Fundam. Informaticae, 2011

2010

Cellular Automata, Decidability and Phasespace.

Klaus Sutner

Fundam. Informaticae, 2010

2009

Cellular Automata, Classification of.

Klaus Sutner

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Model Checking One-Dimensional Cellular Automata.

Klaus Sutner

J. Cell. Autom., 2009

2008

Computational Processes and Incompleteness

Klaus Sutner

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

2005

CDM: Teaching discrete mathematics to computer science majors.

Klaus Sutner

ACM J. Educ. Resour. Comput., 2005

2004

The complexity of reversible cellular automata.

Klaus Sutner

Theor. Comput. Sci., 2004

Universality and Cellular Automata.

Klaus Sutner

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003

The size of power automata.

Klaus Sutner

Theor. Comput. Sci., 2003

Cellular automata and intermediate degrees.

Klaus Sutner

Theor. Comput. Sci., 2003

Reduced Power Automata And Sofic Systems.

Klaus Sutner

Int. J. Found. Comput. Sci., 2003

Almost Periodic Configurations on Linear Cellular Automata.

Klaus Sutner

Fundam. Informaticae, 2003

The Ehrenfeucht-Mycielski Sequence.

Klaus Sutner

Proceedings of the Implementation and Application of Automata, 2003

2002

Cellular Automata and Intermediate Reachability Problems.

Klaus Sutner

Fundam. Informaticae, 2002

Decomposition of Additive Cellular Automata.

Klaus Sutner

Complex Syst., 2002

automata, a Hybrid System for Computational Automata Theory.

Klaus Sutner

Proceedings of the Implementation and Application of Automata, 2002

Reduced Power Automata.

Klaus Sutner

Proceedings of the Implementation and Application of Automata, 2002

2000

sigma-Automata and Chebyshev-Polynomials.

Klaus Sutner

Theor. Comput. Sci., 2000

1998

Two algorithms for a reachability problem in one-dimensional space.

Dajin Wang, Klaus Sutner

IEEE Trans. Syst. Man Cybern. Part A, 1998

1997

Linear Cellular Automata and Fischer Automata.

Klaus Sutner

Parallel Comput., 1997

Computing Optimal Assignments for Residual Network Reliability.

Constantine Stivaros, Klaus Sutner

Discret. Appl. Math., 1997

Exploiting computer algebra systems in computer science courses (panel).

Philip Miller, Kris Stewart, Klaus Sutner, Joseph L. Zachary

Proceedings of the 28th SIGCSE Technical Symposium on Computer Science Education, 1997

1995

The intractability of the reliable assignment problem in split networks.

Constantine Stivaros, Klaus Sutner

Networks, 1995

Preface.

Charles J. Colbourn, Klaus Sutner

Networks, 1995

On the Computational Complexity of Finite Cellular Automata.

Klaus Sutner

J. Comput. Syst. Sci., 1995

1993

Computing Residual Connectedness Reliability for Restricted Networks.

Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner

Discret. Appl. Math., 1993

1992

Implementing Finite State Machines.

Klaus Sutner

Proceedings of the Computational Support for Discrete Mathematics, 1992

1991

The Complexity of the Residual Node Connectedness Reliability Problem.

Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel

SIAM J. Comput., 1991

De Bruijn Graphs and Linear Cellular Automata.

Klaus Sutner

Complex Syst., 1991

1990

The Ordertype of beta-R.E. sets.

Klaus Sutner

J. Symb. Log., 1990

1989

A Note on Culik-Yu Classes.

Klaus Sutner

Complex Syst., 1989

Shuffle Equations, Parallel Transition Systems and Equational Petri Nets.

Stephen L. Bloom, Klaus Sutner

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.

Klaus Sutner

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Additive Automata On Graphs.

Klaus Sutner

Complex Syst., 1988

On σ-Automata.

Klaus Sutner

Complex Syst., 1988

Motion Planning Among Time Dependent Obstacles.

Klaus Sutner, Wolfgang Maass

Acta Informatica, 1988