Armin Hemmerling

发表

1-Pointer Automata Searching Finite Plane Graphs

Armin Hemmerling, 1986, Math. Log. Q..

Function operators spanning the arithmetical and the polynomial hierarchy

Armin Hemmerling, 2010, RAIRO Theor. Informatics Appl..

Effective metric spaces and representations of the reals

Armin Hemmerling, 2002, Theor. Comput. Sci..

On the Tape-Number Problem for Deterministic Time Classes pdf

Armin Hemmerling, A. Hemmerling, 2013, ArXiv.

Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract)

Armin Hemmerling, 2005, Electron. Notes Theor. Comput. Sci..

Navigation Without Perception of Coordinates and Distances

Armin Hemmerling, A. Hemmerling, 1994, Math. Log. Q..

Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch Zellularräume

Armin Hemmerling, 1977, J. Inf. Process. Cybern..

Editorial: MLQ - Math. Log. Quart. 1/2006

Armin Hemmerling, 2006, Math. Log. Q..

Letter from the outgoing Managing Editor/Letter from the new Managing Editor

Armin Hemmerling, Günter Asser, 2005, Math. Log. Q..

The Hausdorff-Ershov Hierarchy in Euclidean Spaces

Armin Hemmerling, A. Hemmerling, 2006, Arch. Math. Log..

Approximate decidability in euclidean spaces

Armin Hemmerling, A. Hemmerling, 2003, Math. Log. Q..

Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-Automaten

Armin Hemmerling, 1979, J. Inf. Process. Cybern..

Systeme von Turing-Automaten und Zellularräume auf rahmbaren Pseudomustermengen

Armin Hemmerling, Armin Hemmerling, Armin Hemmerling, 1979, Journal of Information Processing and Cybernetics.

Editorial: Math. Log. Quart. 1/2007

Armin Hemmerling, 2007, Math. Log. Q..

Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract)

Armin Hemmerling, 1987, FCT.

Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata

Armin Hemmerling, Mathias Bull, 1990, J. Inf. Process. Cybern..

On the Computational Equivalence of Synchronous and Asynchronous Cellular Spaces

Armin Hemmerling, 1982, J. Inf. Process. Cybern..

Turing-Maschinen und Zellularräume in der Ebene

Armin Hemmerling, 1976, J. Inf. Process. Cybern..

Computability Over Structures of Infinite Signature

Armin Hemmerling, 1998, Math. Log. Q..

On Genuine Complexity and Kinds of Nondeterminism

Armin Hemmerling, A. Hemmerling, 1994, J. Inf. Process. Cybern..

Turing-Automaten, Systeme von Turing-Automaten und Zellularräume in mehrdimensionalen Speichermedien

Armin Hemmerling, 1979 .

Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von Zahlenmengen

Armin Hemmerling, 1977, J. Inf. Process. Cybern..

On Searching of Special Cases of Mazes and Finite Embedded Graphs

Armin Hemmerling, Klaus Kriegel, 1984, MFCS.

Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines

Armin Hemmerling, 1986, Bull. EATCS.

D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke

Armin Hemmerling, 1983, J. Inf. Process. Cybern..

Computability of String Functions Over Algebraic Structures

Armin Hemmerling, 1998, Math. Log. Q..

Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich Kodierungen

Armin Hemmerling, 1977, J. Inf. Process. Cybern..

Günter Asser (1926–2015)

Armin Hemmerling, Armin Hemmerling, 2015, Math. Log. Q..

Labyrinth problems : labyrinth-searching abilities of automata

Armin Hemmerling, 1989 .

On P Versus NP for Parameter-Free Programs Over Algebraic Structures

Armin Hemmerling, 2001, Math. Log. Q..

Remark on the Power of Compass (Extended Abstract)

Armin Hemmerling, 1986, MFCS.

Editorial: Math. Log. Quart. 2/2008

Armin Hemmerling, 2008, Math. Log. Q..

A searching algorithm for finite embedded D-graphs with no more than k regions

Armin Hemmerling, 1984, Bull. EATCS.

On the Time Complexity of Partial Real Functions

Armin Hemmerling, 2000, J. Complex..

Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces

Armin Hemmerling, 1979, FCT.

Pebble Automata in Labyrinths with Rotation Systems

Armin Hemmerling, A. Hemmerling, 1991, Math. Log. Q..

Realisierung der Verbandsopteratioen für Regulartiätsklassen von Kodierungen

Armin Hemmerling, 1978, J. Inf. Process. Cybern..

On Regular Sets of Bounds and Determinism versus Nondeterminism pdf

Armin Hemmerling, 2013, ArXiv.

Normed Two-Plane Traps for Finite Systems of Cooperating Compass Automata

Armin Hemmerling, A. Hemmerling, 1987, J. Inf. Process. Cybern..

P=NP for some structures over the binary words

Armin Hemmerling, A. Hemmerling, 2005, J. Complex..

Zur Raumkompliziertheit mehrdimensionaler Turing-Automaten

Armin Hemmerling, Gerd Murawski, Armin Hemmerling, 1984, Math. Log. Q..

Characterizations of the class Deltata2 over Euclidean spaces

Armin Hemmerling, 2004, Math. Log. Q..

Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract)

Armin Hemmerling, A. Hemmerling, 2005, CCA.

Observations on complete sets between linear time and polynomial time

Armin Hemmerling, 2011, Inf. Comput..

On Approximate and Algebraic Computability over the Real Numbers

Armin Hemmerling, 1999, Theor. Comput. Sci..

Traps for Jumping Multihead Counter Automata

Armin Hemmerling, Mathias Bull, 1992, J. Inf. Process. Cybern..

Standard Representations of Effective Metric Spaces

Armin Hemmerling, A. Hemmerling, 2000, CCA.

The discrete parts of approximately decidable sets in Euclidean spaces

Armin Hemmerling, 2003, Math. Log. Q..