Klaus Sutner

Available identifiers

zbMath Open sutner.klausMaRDI QIDQ616505

List of research outcomes

Publication	Date of Publication	Type
Classification of Cellular Automata	2022-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q5145164	2021-01-20	Paper
Abelian Invertible Automata	2020-05-28	Paper
Orbits of abelian automaton groups	2019-12-04	Paper
Iterating Transducers	2016-05-11	Paper
Linear Cellular Automata and Decidability	2015-04-14	Paper
Iterating Inverse Binary Transducers	2015-03-16	Paper
ITERATION OF INVERTIBLE TRANSDUCTIONS	2015-02-09	Paper
Computational Equivalence and Classical Recursion Theory	2014-11-12	Paper
Computational classification of cellular automata	2014-01-06	Paper
Invertible Transductions and Iteration	2013-08-09	Paper
Invertible Transducers, Iteration and Coordinates	2013-08-07	Paper
Universality, Turing Incompleteness and Observers	2013-02-26	Paper
Iterating Invertible Binary Transducers	2012-11-02	Paper
Stephen L. Bloom 1940–2010	2011-11-22	Paper
Cellular Automata, Decidability and Phasespace	2011-05-18	Paper
Computational processes, observers and Turing incompleteness	2011-01-10	Paper
The Ehrenfeucht-Mycielski Sequence	2010-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q5321483	2009-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q3636525	2009-06-30	Paper
Machines, Computations, and Universality	2005-12-08	Paper
REDUCED POWER AUTOMATA AND SOFIC SYSTEMS	2005-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q4657515	2005-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4825161	2004-11-05	Paper
The complexity of reversible cellular automata	2004-10-27	Paper
The size of power automata.	2003-08-17	Paper
Cellular automata and intermediate degrees.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4418615	2003-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4418618	2003-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4799374	2003-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4779182	2002-11-25	Paper
\(\sigma\)-Automata and Chebyshev-polynomials	2000-06-04	Paper
Computing optimal assignments for residual network reliability	1997-12-17	Paper
The intractability of the reliable assignment problem in split networks	1997-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4862892	1996-02-25	Paper
On the computational complexity of finite cellular automata	1995-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q4763344	1995-04-11	Paper
Computing residual connectedness reliability for restricted networks	1993-11-28	Paper
https://portal.mardi4nfdi.de/entity/Q3974887	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3980261	1992-06-26	Paper
Linear cellular automata and the garden-of-eden	1992-06-25	Paper
The σ-Game and Cellular Automata	1992-06-25	Paper
The Complexity of the Residual Node Connectedness Reliability Problem	1991-01-01	Paper
Classifying circular cellular automata	1990-01-01	Paper
The ordertype of β-R.E. sets	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3358252	1989-01-01	Paper
Motion planning among time dependent obstacles	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3805914	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4729363	1988-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Klaus Sutner