Matthias Jantzen

According to our database1, Matthias Jantzen
  • authored at least 35 papers between 1974 and 2008.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2008
Language Classes Defined by Concurrent Finite Automata.
Fundam. Inform., 2008

Petri Net Controlled Finite Automata.
Fundam. Inform., 2008

Labeled Step Sequences in Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2003
Refining the hierarchy of blind multicounter languages and twist-closed trios.
Inf. Comput., 2003

2001
Refining the Hierarchy of Blind Multicounter Languages.
Proceedings of the STACS 2001, 2001

1998
Hierarchies of Principal Twist-Closed Trios.
Proceedings of the STACS 98, 1998

1997
On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1994
Cancellation in Context-Free Languages: Enrichment by Reduction.
Theor. Comput. Sci., 1994

Petri Net Algorithms in the Theory of Matrix Grammars.
Acta Inf., 1994

1993
Cancellation on Context-Free Languages: Enrichment by Reduction.
Proceedings of the STACS 93, 1993

1988
Confluent String Rewriting
EATCS Monographs on Theoretical Computer Science 14, Springer, ISBN: 978-3-642-61549-8, 1988

1987
Dyck1-Reductions of Context-free Languages.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
Complexity of Place/Transition Nets.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

Language Theory of Petri Nets.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

1985
Extending Regular Expressions with Iterated Shuffle.
Theor. Comput. Sci., 1985

A Note on a Special One-Rule Semi-Thue System.
Inf. Process. Lett., 1985

The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets.
Acta Inf., 1985

1984
Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems.
Theor. Comput. Sci., 1984

Thue Systems and the Church-Rosser Property.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

The residue of vector sets with applications to decidability problems in Petri nets.
Proceedings of the Advances in Petri Nets 1984, 1984

1982
Monadic Thue Systems.
Theor. Comput. Sci., 1982

Notions of Computability by Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 1982

1981
On a Special Monoid with a Single Defining Relation.
Theor. Comput. Sci., 1981

The Power of Synchronizing Operations on Strings.
Theor. Comput. Sci., 1981

A Normal Form Theorem for Label Grammars.
Mathematical Systems Theory, 1981

(Erasing)* Strings.
Proceedings of the Theoretical Computer Science, 1981

On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1979
On the hierarchy of Petri net languages.
ITA, 1979

A Note on Vector Grammars.
Inf. Process. Lett., 1979

On Zerotesting-Bounded Multicounter Machines.
Proceedings of the Theoretical Computer Science, 1979

Formal Properties of Place/Transition Nets.
Proceedings of the Net Theory and Applications, 1979

Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and Research.
Proceedings of the Net Theory and Applications, 1979

1977
Renaming and Erasing in Szilard Languages.
Proceedings of the Automata, 1977

1976
About Three Equations Classes of Languages Built Up By Shuffle Operations.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1974
Eine Charakterisierung der Szilardsprachen und ihre Verwendung als Steuersprachen.
Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974


  Loading...