Klaus Sutner - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 49 from 49

2019

Orbits of Abelian Automaton GroupsTim Becker, Klaus Sutner. LATA 2019: 70-81 [doi]

2018

Abelian Invertible AutomataKlaus Sutner. BIRTHDAY 2018: 37-59 [doi]

2016

Cognitive Tutors Produce Adaptive Online Course: Inaugural Field TrialNoboru Matsuda, Martin Van Velsen, Nikolaos Barbalios, Shuqiong Lin, Hardik Vasa, Roya Hosseini, Klaus Sutner, Norman Bier. its 2016: 327-333 [doi]

2015

Iterating TransducersKlaus Sutner. FUIN, 138(1-2):259-272, 2015. [doi]

2014

Iteration of Invertible TransductionsKlaus Sutner. ijfcs, 25(7):857-876, 2014. [doi]

2013

Invertible Transductions and IterationKlaus Sutner. dcfs 2013: 18-29 [doi]

Invertible Transducers, Iteration and CoordinatesKlaus Sutner. wia 2013: 306-318 [doi]

2012

PrefaceJérôme Durand-Lose, Maurice Margenstern, Klaus Sutner. ijfcs, 23(7):1419-1422, 2012. [doi]

Computational classification of cellular automataKlaus Sutner. ijgs, 41(6):595-607, 2012. [doi]

Iterating Inverse Binary TransducersKlaus Sutner, Kevin Lewi. jalc, 17(2-4):293-313, 2012.

Iterating Invertible Binary TransducersKlaus Sutner, Kevin Lewi. dcfs 2012: 294-306 [doi]

2011

Computational processes, observers and Turing incompletenessKlaus Sutner. TCS, 412(1-2):183-190, 2011. [doi]

Stephen L. Bloom 1940-2010Zoltán Ésik, Klaus Sutner. FUIN, 109(4):369-381, 2011. [doi]

2010

Cellular Automata, Decidability and PhasespaceKlaus Sutner. FUIN, 104(1-2):141-160, 2010. [doi]

2009

Model Checking One-Dimensional Cellular AutomataKlaus Sutner. jca, 4(3):213-224, 2009. [doi]

Cellular Automata, Decidability and PhasespaceKlaus Sutner. ncma 2009: 17-30

2008

Computational Processes and IncompletenessKlaus Sutner. icsp 2008: 293-304

2005

CDM: Teaching discrete mathematics to computer science majorsKlaus Sutner. jeric, 5(2):1-11, 2005. [doi]

2004

Universality and Cellular AutomataKlaus Sutner. mcu 2005: 50-59 [doi]

The complexity of reversible cellular automataKlaus Sutner. TCS, 325(2):317-328, 2004. [doi]

2003

Almost Periodic Configurations on Linear Cellular AutomataKlaus Sutner. FUIN, 58(2003):223-240, 2003. [doi]

Reduced Power Automata And Sofic SystemsKlaus Sutner. ijfcs, 14(6):1117, 2003. [doi]

The size of power automataKlaus Sutner. TCS, 295:371-386, 2003. [doi]

Cellular automata and intermediate degreesKlaus Sutner. TCS, 296(2):365-375, 2003. [doi]

The Ehrenfeucht-Mycielski SequenceKlaus Sutner. wia 2003: 282-293 [doi]

2002

Reduced Power AutomataKlaus Sutner. wia 2003: 194-202 [doi]

automata, a Hybrid System for Computational Automata TheoryKlaus Sutner. wia 2003: 221-227 [doi]

Cellular Automata and Intermediate Reachability ProblemsKlaus Sutner. FUIN, 52(1-3):249-256, 2002. [doi]

Decomposition of Additive Cellular AutomataKlaus Sutner. compsys, 13(3), 2002. [doi]

2001

The Size of Power AutomataKlaus Sutner. mfcs 2001: 666-677 [doi]

2000

sigma-Automata and Chebyshev-PolynomialsKlaus Sutner. TCS, 230(1-2):49-73, 2000. [doi]

1998

Two algorithms for a reachability problem in one-dimensional spaceDajin Wang, Klaus Sutner. tsmc, 28(4):478-486, 1998.

1997

Exploiting computer algebra systems in computer science courses (panel)Philip Miller, Kris Stewart, Klaus Sutner, Joseph L. Zachary. sigcse 1997: 377-378 [doi]

Computing Optimal Assignments for Residual Network ReliabilityConstantine Stivaros, Klaus Sutner. DAM, 75(3):285-295, 1997. [doi]

Linear Cellular Automata and Fischer AutomataKlaus Sutner. pc, 23(11):1613-1634, 1997.

1995

PrefaceCharles J. Colbourn, Klaus Sutner. networks, 25(3):99, 1995. [doi]

The intractability of the reliable assignment problem in split networksConstantine Stivaros, Klaus Sutner. networks, 26(4):165-172, 1995. [doi]

On the Computational Complexity of Finite Cellular AutomataKlaus Sutner. jcss, 50(1):87-87, 1995.

1993

Computing Residual Connectedness Reliability for Restricted NetworksCharles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner. DAM, 44(1-3):221-232, 1993. [doi]

1992

Implementing Finite State MachinesKlaus Sutner. dimacs 1994: 347-364

1991

The Complexity of the Residual Node Connectedness Reliability ProblemKlaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel. SICOMP, 20(1):149-155, 1991.

De Bruijn Graphs and Linear Cellular AutomataKlaus Sutner. compsys, 5(1), 1991. [doi]

1990

The Ordertype of beta-R.E. setsKlaus Sutner. JSYML, 55(2):573-576, 1990.

1989

Shuffle Equations, Parallel Transition Systems and Equational Petri NetsStephen L. Bloom, Klaus Sutner. tapsoft 1989: 134-148

The Computational Complexity of Cellular AutomataKlaus Sutner. fct 1989: 451-459

A Note on Culik-Yu ClassesKlaus Sutner. compsys, 3(1), 1989. [doi]

1988

Motion Planning Among Time Dependent ObstaclesKlaus Sutner, Wolfgang Maass. ACTA, 26(1/2):93-122, 1988.

On σ-AutomataKlaus Sutner. compsys, 2(1), 1988. [doi]

Additive Automata On GraphsKlaus Sutner. compsys, 2(6), 1988. [doi]

Sign in or sign up to see more results.

runs on WebDSL