oDOBS - Author page: Klaus Madlener
lupus.cs.uni-dortmund.de
Friedrich OTTO, Andrea SATTLER-KLEIN, Klaus MADLENER: Automatic Monoids Versus Monoids with Finite Convergent Presentations. 36: EE: Jürgen AVENHAUS, Reinhard GOTZHEIN, Theo ...
An Algorithm for the Word Problem in HNN Extensions and the...
books.google.de
... for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. Front Cover. Jürgen Avenhaus, Klaus Madlener.
Groups presented by finite two monadic Church-Rosser Thue systems -...
books.google.de
Groups presented by finite two-monadic Church-Rosser Thue systems. Front Cover. Jürgen Avenhaus, Klaus Madlener, Friedrich Otto. Univ., pages.
String matching and algorithmic problems in free groups - Jürgen...
books.google.de
String matching and algorithmic problems in free groups. Front Cover. Jürgen Avenhaus, Klaus Madlener. Fachbereich Informatik, Univ. Kaiserslautern,
Bibliographie - Matthias Jantzen (nee Höpner)
www.informatik.uni-hamburg.de
Bibliography Matthias Jantzen ... In Jürgen Avenhaus and Klaus Madlener, editors, Proceedings of the workshop Combinatorial Algorithms in Algebraic Structures ...
Bibliography - Jantzen85a
www2.informatik.uni-hamburg.de
In Jürgen Avenhaus and Klaus Madlener, editors, Proceedings of the workshop Combinatorial Algorithms in Algebraic Structures (Otzenhausen, 1985), pages , Otzenhausen, 1985
Wikipedia: Rewriting - Wikipedia
In mathematics, computer science, and logic, rewriting covers a wide range of (potentially ... Jürgen Avenhaus and Klaus Madlener. "Term rewriting and ...
Alle Infos zum Namen "Jürgen Avenhaus"
Acta Informatica
ftp.math.utah.edu
Jan Paredaens and R. Vyncke A Class of Measures on Formal Languages Jürgen Avenhaus and Klaus Madlener Subrekursive ...
DiSC - Norbert Ritter
www09.sigmod.org
10 Jürgen Avenhaus , Reinhard Gotzhein , Theo Härder , L. Litz , Klaus Madlener , J. Nehmer , Michael M. Richter , Norbert Ritter, H. Dieter Rombach , Bernd ...
DBLP: Jürgen Nehmer
vldbarc.org
Jürgen Avenhaus, Reinhard Gotzhein, Theo Härder, Lothar Litz, Klaus Madlener, Jürgen Nehmer, Michael M. Richter, Norbert Ritter, H. Dieter Rombach, Bernd ...
EUDML | String Matching And Algorithmic Problems In Free Groups.
eudml.org
String Matching And Algorithmic Problems In Free Groups. Klaus Madlener; Jürgen Avenhaus · Revista colombiana de matematicas (1980). Volume: 14, page
PROTHEO.5.2.html PROTHEO Inriaraweb.inria.fr › rapportsactivite › PROTHEO.5.2.html
raweb.inria.fr
Il se trouve que nous travaillons sur des sujets très voisins: la réécriture et la déduction concurrente à Kaiserslautern avec Jürgen Avenhaus et Klaus Madlener, ...
RTA
rewriting.loria.fr
Conference Chairs: Juergen Avenhaus and Klaus Madlener (Kaiserslautern) Invited speakers: Y. Matiyasevich, On Some Mathematical Logic ...
x026
sites.radford.edu
... of Groups. journals/ita/AvenhausM81:::Jürgen Avenhaus::Klaus Madlener:::An Algorithm for the Word Problem in <i>HNN</i> Extensions and the Dependence ...
x Radford University
sites.radford.edu
... the Parallel Chip Firing Game on Graphs. journals/tcs/AvenhausM84:::Jürgen Avenhaus::Klaus Madlener:::The Nielsen Reduction and P-Complete Problems ...
Sociedad Colombiana de Matemáticas:Publicaciones
ftp.gwdg.de
Jürgen Avenhaus, Klaus Madlener, String matching and algorithic problems in free groups Revista Colombiana de Matemáticas Vol 14 [1] (1980).
sortiert nach Relevanz / Datum