Matthias Jantzen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2008

Petri Net Controlled Finite AutomataBerndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, Georg Zetzsche. FUIN, 85(1-4):111-121, 2008. [doi]

Labeled Step Sequences in Petri NetsMatthias Jantzen, Georg Zetzsche. apn 2008: 270-287 [doi]

Language Classes Defined by Concurrent Finite AutomataMatthias Jantzen, Manfred Kudlek, Georg Zetzsche. FUIN, 85(1-4):267-280, 2008. [doi]

2003

Refining the hierarchy of blind multicounter languages and twist-closed triosMatthias Jantzen, Alexy Kurganskyy. iandc, 185(2):159-181, 2003. [doi]

2001

Refining the Hierarchy of Blind Multicounter LanguagesMatthias Jantzen, Alexy Kurganskyy. STACS 2001: 376-387 [doi]

1998

Hierarchies of Principal Twist-Closed TriosMatthias Jantzen. STACS 1998: 344-355

1997

On Twist-Closed Trios: A New Morphic Characterization of r.e. SetsMatthias Jantzen. BIRTHDAY 1997: 135-142 [doi]

1994

Petri Net Algorithms in the Theory of Matrix GrammarsDirk Hauschildt, Matthias Jantzen. ACTA, 31(8):719-728, 1994.

Cancellation in Context-Free Languages: Enrichment by ReductionMatthias Jantzen, Holger Petersen. TCS, 127(1):149-170, 1994.

1993

Cancellation on Context-Free Languages: Enrichment by ReductionMatthias Jantzen, Holger Petersen. STACS 1993: 206-215

1988

Confluent String RewritingMatthias Jantzen. Volume 14 of EATCS Monographs on Theoretical Computer Science, Springer, 1988. [doi]

1987

Dyck::1::-Reductions of Context-free LanguagesMatthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen. fct 1987: 218-227

1986

Language Theory of Petri NetsMatthias Jantzen. ac 1987: 397-412

Complexity of Place/Transition NetsMatthias Jantzen. ac 1987: 413-434

1985

A Note on a Special One-Rule Semi-Thue SystemMatthias Jantzen. ipl, 21(3):135-140, 1985.

Extending Regular Expressions with Iterated ShuffleMatthias Jantzen. TCS, 38:223-247, 1985.

The Residue of Vector Sets with Applications to Decidability Problems in Petri NetsRüdiger Valk, Matthias Jantzen. ACTA, 21:643-674, 1985.

1984

Thue Systems and the Church-Rosser PropertyMatthias Jantzen. mfcs 1984: 80-95

Homomorphic Images of Sentential Form Languages Defined by Semi-Thue SystemsMatthias Jantzen, Manfred Kudlek. TCS, 33:13-43, 1984.

The residue of vector sets with applications to decidability problems in Petri netsRüdiger Valk, Matthias Jantzen. apn 1985: 234-258

1982

Monadic Thue SystemsRonald V. Book, Matthias Jantzen, Celia Wrathall. TCS, 19:231-251, 1982.

Notions of Computability by Petri NetsMatthias Jantzen, Hendrik Bramhoff. apn 1983: 149-165

1981

1979

On Zerotesting-Bounded Multicounter MachinesMatthias Jantzen. tcs 1979: 158-169

On the hierarchy of Petri net languagesMatthias Jantzen. ita, 13(1):19-30, 1979.

A Note on Vector GrammarsMatthias Jantzen. ipl, 8(1):32-33, 1979.

1975

Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and ResearchMatthias Jantzen. ac 1980: 507-517

Formal Properties of Place/Transition NetsMatthias Jantzen, Rüdiger Valk. ac 1980: 165-212

Sign in or sign up to see more results.

runs on WebDSL