Search the dblp DataBase
Matthias Jantzen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Matthias Jantzen Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and Research. [Citation Graph (0, 0)][DBLP ] Advanced Course: Net Theory and Applications, 1975, pp:507-517 [Conf ] Matthias Jantzen Language Theory of Petri Nets. [Citation Graph (0, 0)][DBLP ] Advances in Petri Nets, 1986, pp:397-412 [Conf ] Matthias Jantzen Complexity of Place/Transition Nets. [Citation Graph (0, 0)][DBLP ] Advances in Petri Nets, 1986, pp:413-434 [Conf ] Matthias Jantzen , Rüdiger Valk Formal Properties of Place/Transition Nets. [Citation Graph (0, 0)][DBLP ] Advanced Course: Net Theory and Applications, 1975, pp:165-212 [Conf ] Matthias Jantzen , Hendrik Bramhoff Notions of Computability by Petri Nets. [Citation Graph (0, 0)][DBLP ] European Workshop on Applications and Theory of Petri Nets, 1982, pp:149-165 [Conf ] Rüdiger Valk , Matthias Jantzen The residue of vector sets with applications to decidability problems in Petri nets. [Citation Graph (0, 0)][DBLP ] European Workshop on Applications and Theory in Petri Nets, 1984, pp:234-258 [Conf ] Matthias Jantzen On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets. [Citation Graph (0, 0)][DBLP ] Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:135-142 [Conf ] Matthias Jantzen , Manfred Kudlek , Klaus-Jörn Lange , Holger Petersen Dyck1 -Reductions of Context-free Languages. [Citation Graph (0, 0)][DBLP ] FCT, 1987, pp:218-227 [Conf ] Ronald V. Book , Matthias Jantzen , Burkhard Monien , Colm Ó'Dúnlaing , Celia Wrathall On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:216-223 [Conf ] Matthias Jantzen Thue Systems and the Church-Rosser Property. [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:80-95 [Conf ] Matthias Jantzen Hierarchies of Principal Twist-Closed Trios. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:344-355 [Conf ] Matthias Jantzen , Alexy Kurganskyy Refining the Hierarchy of Blind Multicounter Languages. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:376-387 [Conf ] Matthias Jantzen , Holger Petersen Cancellation on Context-Free Languages: Enrichment by Reduction. [Citation Graph (0, 0)][DBLP ] STACS, 1993, pp:206-215 [Conf ] Ronald V. Book , Matthias Jantzen , Celia Wrathall (Erasing)* Strings. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1981, pp:252-259 [Conf ] Matthias Jantzen On Zerotesting-Bounded Multicounter Machines. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1979, pp:158-169 [Conf ] Dirk Hauschildt , Matthias Jantzen Petri Net Algorithms in the Theory of Matrix Grammars. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1994, v:31, n:8, pp:719-728 [Journal ] Rüdiger Valk , Matthias Jantzen The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1985, v:21, n:, pp:643-674 [Journal ] Matthias Jantzen , Alexy Kurganskyy Refining the hierarchy of blind multicounter languages and twist-closed trios. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:185, n:2, pp:159-181 [Journal ] Matthias Jantzen A Note on Vector Grammars. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1979, v:8, n:1, pp:32-33 [Journal ] Matthias Jantzen A Note on a Special One-Rule Semi-Thue System. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:21, n:3, pp:135-140 [Journal ] Matthias Jantzen On the hierarchy of Petri net languages. [Citation Graph (0, 0)][DBLP ] ITA, 1979, v:13, n:1, pp:- [Journal ] Matthias Jantzen , Manfred Opp A Normal Form Theorem for Label Grammars. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1981, v:14, n:, pp:289-303 [Journal ] Ronald V. Book , Matthias Jantzen , Celia Wrathall Monadic Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:19, n:, pp:231-251 [Journal ] Matthias Jantzen The Power of Synchronizing Operations on Strings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1981, v:14, n:, pp:127-154 [Journal ] Matthias Jantzen On a Special Monoid with a Single Defining Relation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1981, v:16, n:, pp:61-73 [Journal ] Matthias Jantzen Extending Regular Expressions with Iterated Shuffle. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:38, n:, pp:223-247 [Journal ] Matthias Jantzen , Manfred Kudlek Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1984, v:33, n:, pp:13-43 [Journal ] Matthias Jantzen , Holger Petersen Cancellation in Context-Free Languages: Enrichment by Reduction. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:127, n:1, pp:149-170 [Journal ] Labeled Step Sequences in Petri Nets. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.005secs