Günter Hotz

Affiliations:
  • Saarland University, Saarbrücken, Germany


According to our database1, Günter Hotz authored at least 58 papers between 1962 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Representation Theorems for Analytic Machines and Computability of Analytic Functions.
Theory Comput. Syst., 2012

New Invariants for the Graph Isomorphism Problem
CoRR, 2012

2009
Computability of Analytic Functions with Analytic Machines.
Proceedings of the Mathematical Theory and Computational Practice, 2009

Kolmogorov-Complexity Based on Infinite Computations.
Proceedings of the Efficient Algorithms, 2009

2008
Über "Über den Plankalkül" von Konrad Zuse.
it Inf. Technol., 2008

2004
A remark on nondecidabilities of the initial value problem of ODEs
Electron. Colloquium Comput. Complex., 2004

2001
Recursive analytic functions of a complex variable
Electron. Colloquium Comput. Complex., 2001

Planarity Testing of Graphs on Base of a Spring Model.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999
Analytic Machines.
Theor. Comput. Sci., 1999

Calculation of contact forces.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 1999

SiLVIA - A Simulation Library for Virtual Reality Applications.
Proceedings of the IEEE Virtual Reality 1999 Conference, 1999

1997
On Using Semi-Dyck Sets to Analyse Coupled-Context-Free Languages.
Fundam. Informaticae, 1997

Diagnosis of Tank Ballast Systems.
Proceedings of the Advances in Intelligent Data Analysis, 1997

Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries.
Proceedings of the European Design and Test Conference, 1997

On the Arrangement Complexity of Uniform Trees.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
On Parsing Coupled-Context-Free Languages.
Theor. Comput. Sci., 1996

1995
Analytic Machines
Electron. Colloquium Comput. Complex., 1995

A New Approach to Analyse Coupled-Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Zum 25jährigen Jubiläum.
Inform. Spektrum, 1994

A Hierarchical Environment for Interactive Test Engineering.
Proceedings of the Proceedings IEEE International Test Conference 1994, 1994

Fast Uniform Analysis of Coupled-Context-Free Languages.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Search Trees and Search Graphs for Markov Sources.
J. Inf. Process. Cybern., 1993

1990
TAGs by interpreting Context Free Tree Languages.
Proceedings of the First International Workshop on Tree Adjoining Grammar and Related Frameworks, 1990

A graphical system for hierarchical specifications and checkups of VLSI circuits.
Proceedings of the European Design Automation Conference, 1990

Einführung in die Informatik.
Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02246-6, 1990

1989
The Power of the Greibach Normal Form.
J. Inf. Process. Cybern., 1989

1988
Anwendungen und Portierungen der Programmiersprache Comskee.
Proceedings of the Innovative Informations-Infrastrukturen, 1988

1987
On the Optimal Layout of Planar Graphs with Fixed Boundary.
SIAM J. Comput., 1987

Hierarchical Design Based on a Calculus of Nets.
Proceedings of the 24th ACM/IEEE Design Automation Conference. Miami Beach, FL, USA, June 28, 1987

1986
A Representation Theorem of Infinite Dimensional Algebras and Applications to Language Theory.
J. Comput. Syst. Sci., 1986

Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil II.
Inform. Forsch. Entwickl., 1986

Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil I.
Inform. Forsch. Entwickl., 1986

On Network Algebras and Recursive Equations.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1984
Outline of an Algebraic Language Theory.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Über die logisch-topologische Entwurfsebene bei der Konstruktion großer integrierter Schaltkreise.
Proceedings of the Fachgespräche auf der 14. GI-Jahrestagung, 1984

1981
k-dimensionale syntaktische Monoide.
J. Inf. Process. Cybern., 1981

Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sprachen.
Proceedings of the Theoretical Computer Science, 1981

1980
Eine neue Invariante für Kontextfreie Sprachen.
Theor. Comput. Sci., 1980

Verschränkte Homomorphismen Formaler Sprachen.
RAIRO Theor. Informatics Appl., 1980

Konrad Zuse: Forschung und Entwicklung.
Inform. Spektrum, 1980

1979
Über die Darstellbarkeit des syntaktischen Monoïdes kontextfreier Sprachen.
RAIRO Theor. Informatics Appl., 1979

LL(k)- und LR(k)-Invarianz von kontexfreien Grammatiken unter einer Transformation auf Greibach-Normalform.
J. Inf. Process. Cybern., 1979

Necessary decidable conditions for the word and equivalence problem of formal languages.
Proceedings of the Fundamentals of Computation Theory, 1979

1978
Normal-form transformations of context-free grammars.
Acta Cybern., 1978

1977
Space-Komplexität von klammerfreien Ausdrücken mit Typen.
J. Inf. Process. Cybern., 1977

Network Complexity.
Proceedings of the Fundamentals of Computation Theory, 1977

1976
Schranken für Balanced Trees bei ausgewogenen Verteilungen.
Theor. Comput. Sci., 1976

1974
Sequentielle Analyse kontextfreier Sprachen.
Acta Informatica, 1974

Komplexitätsmaße für Ausdrücke.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Axiomatisierung bei Programmiersprachen und ihre Grenzen.
Proceedings of the Programming Methodology, 4th Informatik Symposium, 1974

Strukturelle Verwandtschaften von semi-Thue-Systemen.
Proceedings of the Category Theory Applied to Computation and Control, 1974

1969
Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen.
Computing, 1969

1968
Eine Bemerkung zur Zerlegung von Produktionssystemen von Semi-Thue-Systemen.
J. Inf. Process. Cybern., 1968

1967
Quasilineare Automaten.
Computing, 1967

1966
Eindeutigkeit und Mehrdeutigkeit formaler Sprachen.
J. Inf. Process. Cybern., 1966

1965
Eine Algebraisierung des Syntheseproblems von Schaltkreisen II.
J. Inf. Process. Cybern., 1965

Eine Algebraisierung des Syntheseproblems von Schaltkreisen I.
J. Inf. Process. Cybern., 1965

1962
Digital Filters with Threshold Elements.
Proceedings of the Information Processing, Proceedings of the 2nd IFIP Congress 1962, Munich, Germany, August 27, 1962


  Loading...