( en | de | ru )

 

Disambiguation of "Jantzen, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Confluent String Rewriting

. EATCS Monographs on Theoretical Computer Science Springer, (1988)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthias Jantzen

Matthias Jantzen

Katharina Jantzen

Klaus Jantzen

Winfried Jantzen

 

Other publications of authors with the same name

Thue Systems and the Church-Rosser Property.. MFCS, volume 176 of Lecture Notes in Computer Science, page 80-95. Springer, (1984)On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets.. Foundations of Computer Science: Potential - Theory - Cognition, volume 1337 of Lecture Notes in Computer Science, page 135-142. Springer, (1997)Dyck1-Reductions of Context-free Languages., , , and . FCT, volume 278 of Lecture Notes in Computer Science, page 218-227. Springer, (1987)Notions of Computability by Petri Nets., and . European Workshop on Applications and Theory of Petri Nets, volume 66 of Informatik-Fachberichte, page 149-165. Springer, (1982)Complexity of Place/Transition Nets.. Advances in Petri Nets, volume 254 of Lecture Notes in Computer Science, page 413-434. Springer, (1986)Refining the Hierarchy of Blind Multicounter Languages., and . STACS, volume 2010 of Lecture Notes in Computer Science, page 376-387. Springer, (2001)Formal Properties of Place/Transition Nets., and . Advanced Course: Net Theory and Applications, volume 84 of Lecture Notes in Computer Science, page 165-212. Springer, (1979)Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and Research.. Advanced Course: Net Theory and Applications, volume 84 of Lecture Notes in Computer Science, page 507-517. Springer, (1979)Refining the hierarchy of blind multicounter languages and twist-closed trios., and . Inf. Comput., 185 (2): 159-181 (2003)(Erasing)* Strings., , and . Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, page 252-259. Springer, (1981)