Lutz Priese

From MaRDI portal
Person:222854

Available identifiers

zbMath Open priese.lutzMaRDI QIDQ222854

List of research outcomes





PublicationDate of PublicationType
Algebraic characterization of petri net pomset semantics2023-05-17Paper
Aspekte des Unendlichen2019-09-05Paper
Vanishing Point Detection with an Intersection Point Neighborhood2009-12-01Paper
Some Examples of Semi-rational DAG Languages2009-03-26Paper
Theoretical computer science. Petri nets.2008-05-22Paper
Petri-Netze2008-01-03Paper
Finite Automata on Unranked and Unordered DAGs2007-11-28Paper
Developments in Language Theory2006-06-23Paper
https://portal.mardi4nfdi.de/entity/Q44481252004-02-17Paper
https://portal.mardi4nfdi.de/entity/Q44313522003-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44102332003-07-02Paper
Theoretical informatics. An extensive introduction2002-01-14Paper
https://portal.mardi4nfdi.de/entity/Q49555442000-05-28Paper
https://portal.mardi4nfdi.de/entity/Q49392062000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42684741999-10-28Paper
A uniform approach to true-concurrency and interleaving semantics for Petri nets1999-01-12Paper
Abstract fairness and semantics1998-07-23Paper
Fairness, distances and degrees1992-09-27Paper
Strong fairness and ultra metrics1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q57504061989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38231221988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38155321988-01-01Paper
On the minimal number of \(\times\) operators to model regularity in fair SCCS1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37534771987-01-01Paper
An introduction to the regular theory of fairness1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37635751987-01-01Paper
On a fast decomposition method in some models of concurrent computations1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33401691984-01-01Paper
Automata and concurrency1983-01-01Paper
Petri net implementations by a universal cell space1982-01-01Paper
Modular implementation of concurrency1982-01-01Paper
Universal asynchronous iterative arrays of Mealy automata1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39064271980-01-01Paper
Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines1979-01-01Paper
Über ein 2‐Dimensionales Thue‐System mit Zwei Regeln und Unentscheidbarem Wortproblem1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41901441979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41962941978-01-01Paper
A note on asynchronous cellular automata1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32063241978-01-01Paper
On the Minimal Complexity of Component-Machines for Self-Correcting Networks1976-01-01Paper
Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme1976-01-01Paper
ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION1976-01-01Paper
A Combinatorial Approach to Self-Correction1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56580841971-01-01Paper

Research outcomes over time

This page was built for person: Lutz Priese