default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Sutner
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c16]Tim Becker, Klaus Sutner:
Orbits of Abelian Automaton Groups. LATA 2019: 70-81- 2018
- [p1]Klaus Sutner:
Abelian Invertible Automata. Reversibility and Universality 2018: 37-59 - 2016
- [c15]Noboru Matsuda
, Martin Van Velsen, Nikolaos Barbalios, Shuqiong Lin, Hardik Vasa, Roya Hosseini, Klaus Sutner, Norman L. Bier:
Cognitive Tutors Produce Adaptive Online Course: Inaugural Field Trial. ITS 2016: 327-333 - 2015
- [j32]Klaus Sutner:
Iterating Transducers. Fundam. Informaticae 138(1-2): 259-272 (2015) - 2014
- [j31]Klaus Sutner:
Iteration of Invertible Transductions. Int. J. Found. Comput. Sci. 25(7): 857-876 (2014) - 2013
- [c14]Klaus Sutner:
Invertible Transductions and Iteration. DCFS 2013: 18-29 - [c13]Klaus Sutner:
Invertible Transducers, Iteration and Coordinates. CIAA 2013: 306-318 - 2012
- [j30]Jérôme Durand-Lose, Maurice Margenstern, Klaus Sutner:
Preface. Int. J. Found. Comput. Sci. 23(7): 1419-1422 (2012) - [j29]Klaus Sutner:
Computational classification of cellular automata. Int. J. Gen. Syst. 41(6): 595-607 (2012) - [j28]Klaus Sutner, Kevin Lewi:
Iterating Inverse Binary Transducers. J. Autom. Lang. Comb. 17(2-4): 293-313 (2012) - [c12]Klaus Sutner, Kevin Lewi:
Iterating Invertible Binary Transducers. DCFS 2012: 294-306 - 2011
- [j27]Zoltán Ésik, Klaus Sutner:
Stephen L. Bloom 1940-2010. Fundam. Informaticae 109(4): 369-381 (2011) - [j26]Klaus Sutner:
Computational processes, observers and Turing incompleteness. Theor. Comput. Sci. 412(1-2): 183-190 (2011) - 2010
- [j25]Klaus Sutner:
Cellular Automata, Decidability and Phasespace. Fundam. Informaticae 104(1-2): 141-160 (2010)
2000 – 2009
- 2009
- [j24]Klaus Sutner:
Model Checking One-Dimensional Cellular Automata. J. Cell. Autom. 4(3): 213-224 (2009) - [c11]Klaus Sutner:
Cellular Automata, Decidability and Phasespace. NCMA 2009: 17-30 - [r1]Klaus Sutner:
Cellular Automata, Classification of. Encyclopedia of Complexity and Systems Science 2009: 755-768 - 2008
- [c10]Klaus Sutner:
Computational Processes and Incompleteness. CSP 2008: 226-234 - 2005
- [j23]Klaus Sutner:
CDM: Teaching discrete mathematics to computer science majors. ACM J. Educ. Resour. Comput. 5(2): 4:1-4:11 (2005) - 2004
- [j22]Klaus Sutner:
The complexity of reversible cellular automata. Theor. Comput. Sci. 325(2): 317-328 (2004) - [c9]Klaus Sutner:
Universality and Cellular Automata. MCU 2004: 50-59 - 2003
- [j21]Klaus Sutner:
Almost Periodic Configurations on Linear Cellular Automata. Fundam. Informaticae 58(2003): 223-240 (2003) - [j20]Klaus Sutner:
Reduced Power Automata And Sofic Systems. Int. J. Found. Comput. Sci. 14(6): 1117- (2003) - [j19]Klaus Sutner:
The size of power automata. Theor. Comput. Sci. 295: 371-386 (2003) - [j18]Klaus Sutner:
Cellular automata and intermediate degrees. Theor. Comput. Sci. 296(2): 365-375 (2003) - [c8]Klaus Sutner:
The Ehrenfeucht-Mycielski Sequence. CIAA 2003: 282-293 - 2002
- [j17]Klaus Sutner:
Decomposition of Additive Cellular Automata. Complex Syst. 13(3) (2002) - [j16]Klaus Sutner:
Cellular Automata and Intermediate Reachability Problems. Fundam. Informaticae 52(1-3): 249-256 (2002) - [c7]Klaus Sutner:
Reduced Power Automata. CIAA 2002: 194-202 - [c6]Klaus Sutner:
automata, a Hybrid System for Computational Automata Theory. CIAA 2002: 221-227 - 2001
- [c5]Klaus Sutner:
The Size of Power Automata. MFCS 2001: 666-677 - 2000
- [j15]Klaus Sutner:
sigma-Automata and Chebyshev-Polynomials. Theor. Comput. Sci. 230(1-2): 49-73 (2000)
1990 – 1999
- 1998
- [j14]Dajin Wang, Klaus Sutner:
Two algorithms for a reachability problem in one-dimensional space. IEEE Trans. Syst. Man Cybern. Part A 28(4): 478-486 (1998) - 1997
- [j13]Constantine Stivaros, Klaus Sutner:
Computing Optimal Assignments for Residual Network Reliability. Discret. Appl. Math. 75(3): 285-295 (1997) - [j12]Klaus Sutner:
Linear Cellular Automata and Fischer Automata. Parallel Comput. 23(11): 1613-1634 (1997) - [c4]Philip Miller, Kris Stewart, Klaus Sutner, Joseph L. Zachary:
Exploiting computer algebra systems in computer science courses (panel). SIGCSE 1997: 377-378 - 1995
- [j11]Klaus Sutner:
On the Computational Complexity of Finite Cellular Automata. J. Comput. Syst. Sci. 50(1): 87 (1995) - [j10]Charles J. Colbourn, Klaus Sutner:
Preface. Networks 25(3): 99 (1995) - [j9]Constantine Stivaros, Klaus Sutner:
The intractability of the reliable assignment problem in split networks. Networks 26(4): 165-172 (1995) - 1993
- [j8]Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner:
Computing Residual Connectedness Reliability for Restricted Networks. Discret. Appl. Math. 44(1-3): 221-232 (1993) - 1992
- [c3]Klaus Sutner:
Implementing Finite State Machines. Computational Support for Discrete Mathematics 1992: 347-363 - 1991
- [j7]Klaus Sutner:
De Bruijn Graphs and Linear Cellular Automata. Complex Syst. 5(1) (1991) - [j6]Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel:
The Complexity of the Residual Node Connectedness Reliability Problem. SIAM J. Comput. 20(1): 149-155 (1991) - 1990
- [j5]Klaus Sutner:
The Ordertype of beta-R.E. sets. J. Symb. Log. 55(2): 573-576 (1990)
1980 – 1989
- 1989
- [j4]Klaus Sutner:
A Note on Culik-Yu Classes. Complex Syst. 3(1) (1989) - [c2]Klaus Sutner:
The Computational Complexity of Cellular Automata. FCT 1989: 451-459 - [c1]Stephen L. Bloom, Klaus Sutner:
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. TAPSOFT, Vol.1 1989: 134-148 - 1988
- [j3]Klaus Sutner, Wolfgang Maass:
Motion Planning Among Time Dependent Obstacles. Acta Informatica 26(1/2): 93-122 (1988) - [j2]Klaus Sutner:
On σ-Automata. Complex Syst. 2(1) (1988) - [j1]Klaus Sutner:
Additive Automata On Graphs. Complex Syst. 2(6) (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
