default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Jantzen
Person information
- affiliation: University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j15]Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, Georg Zetzsche:
Petri Net Controlled Finite Automata. Fundam. Informaticae 85(1-4): 111-121 (2008)- [j14]Matthias Jantzen, Manfred Kudlek, Georg Zetzsche:
Language Classes Defined by Concurrent Finite Automata. Fundam. Informaticae 85(1-4): 267-280 (2008) - [c19]Matthias Jantzen, Georg Zetzsche
:
Labeled Step Sequences in Petri Nets. Petri Nets 2008: 270-287 - 2003
- [j13]Matthias Jantzen, Alexy Kurganskyy:
Refining the hierarchy of blind multicounter languages and twist-closed trios. Inf. Comput. 185(2): 159-181 (2003) - 2001
- [c18]Matthias Jantzen, Alexy Kurganskyy:
Refining the Hierarchy of Blind Multicounter Languages. STACS 2001: 376-387
1990 – 1999
- 1998
- [c17]Matthias Jantzen:
Hierarchies of Principal Twist-Closed Trios. STACS 1998: 344-355 - 1997
- [c16]Matthias Jantzen:
On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets. Foundations of Computer Science: Potential - Theory - Cognition 1997: 135-142 - [p1]Matthias Jantzen:
Basics of Term Rewriting. Handbook of Formal Languages (3) 1997: 269-337 - [e3]Christian Freksa, Matthias Jantzen, Rüdiger Valk:
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday. Lecture Notes in Computer Science 1337, Springer 1997, ISBN 3-540-63746-X [contents] - 1994
- [j12]Dirk Hauschildt, Matthias Jantzen:
Petri Net Algorithms in the Theory of Matrix Grammars. Acta Informatica 31(8): 719-728 (1994) - [j11]Matthias Jantzen, Holger Petersen:
Cancellation in Context-Free Languages: Enrichment by Reduction. Theor. Comput. Sci. 127(1): 149-170 (1994) - 1993
- [c15]Matthias Jantzen, Holger Petersen:
Cancellation on Context-Free Languages: Enrichment by Reduction. STACS 1993: 206-215 - 1992
- [e2]Alain Finkel, Matthias Jantzen:
STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings. Lecture Notes in Computer Science 577, Springer 1992, ISBN 3-540-55210-3 [contents] - 1991
- [e1]Christian Choffrut, Matthias Jantzen:
STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings. Lecture Notes in Computer Science 480, Springer 1991, ISBN 3-540-53709-0 [contents]
1980 – 1989
- 1988
- [b1]Matthias Jantzen:
Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science 14, Springer 1988, ISBN 978-3-642-64867-0, pp. I-IX, 1-126 - 1987
- [c14]Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen:
Dyck1-Reductions of Context-free Languages. FCT 1987: 218-227 - 1986
- [c13]Matthias Jantzen:
Language Theory of Petri Nets. Advances in Petri Nets 1986: 397-412 - [c12]Matthias Jantzen:
Complexity of Place/Transition Nets. Advances in Petri Nets 1986: 413-434 - 1985
- [j10]Rüdiger Valk, Matthias Jantzen:
The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica 21: 643-674 (1985) - [j9]Matthias Jantzen:
A Note on a Special One-Rule Semi-Thue System. Inf. Process. Lett. 21(3): 135-140 (1985) - [j8]Matthias Jantzen:
Extending Regular Expressions with Iterated Shuffle. Theor. Comput. Sci. 38: 223-247 (1985) - 1984
- [j7]Matthias Jantzen, Manfred Kudlek:
Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems. Theor. Comput. Sci. 33: 13-43 (1984) - [c11]Rüdiger Valk, Matthias Jantzen:
The residue of vector sets with applications to decidability problems in Petri nets. European Workshop on Applications and Theory in Petri Nets 1984: 234-258 - [c10]Matthias Jantzen:
Thue Systems and the Church-Rosser Property. MFCS 1984: 80-95 - 1982
- [j6]Ronald V. Book, Matthias Jantzen, Celia Wrathall:
Monadic Thue Systems. Theor. Comput. Sci. 19: 231-251 (1982) - [c9]Matthias Jantzen, Hendrik Bramhoff:
Notions of Computability by Petri Nets. European Workshop on Applications and Theory of Petri Nets 1982: 149-165 - 1981
- [j5]Matthias Jantzen, Manfred Opp:
A Normal Form Theorem for Label Grammars. Math. Syst. Theory 14: 289-303 (1981) - [j4]Matthias Jantzen:
The Power of Synchronizing Operations on Strings. Theor. Comput. Sci. 14: 127-154 (1981) - [j3]Matthias Jantzen:
On a Special Monoid with a Single Defining Relation. Theor. Comput. Sci. 16: 61-73 (1981) - [c8]Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS 1981: 216-223 - [c7]Ronald V. Book, Matthias Jantzen, Celia Wrathall:
(Erasing)* Strings. Theoretical Computer Science 1981: 252-259
1970 – 1979
- 1979
- [j2]Matthias Jantzen:
A Note on Vector Grammars. Inf. Process. Lett. 8(1): 32-33 (1979) - [j1]Matthias Jantzen:
On the hierarchy of Petri net languages. RAIRO Theor. Informatics Appl. 13(1): 19-30 (1979) - [c6]Matthias Jantzen, Rüdiger Valk:
Formal Properties of Place/Transition Nets. Advanced Course: Net Theory and Applications 1979: 165-212 - [c5]Matthias Jantzen:
Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and Research. Advanced Course: Net Theory and Applications 1979: 507-517 - [c4]Matthias Jantzen:
On Zerotesting-Bounded Multicounter Machines. Theoretical Computer Science 1979: 158-169 - 1977
- [c3]Matthias Höpner, Manfred Opp:
Renaming and Erasing in Szilard Languages. ICALP 1977: 244-257 - 1976
- [c2]Matthias Höpner, Manfred Opp:
About Three Equations Classes of Languages Built Up By Shuffle Operations. MFCS 1976: 337-344 - 1974
- [c1]Matthias Höpner:
Eine Charakterisierung der Szilardsprachen und ihre Verwendung als Steuersprachen. GI Jahrestagung 1974: 113-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
