Angelo Morzenti

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the approximability of some maximum spanning tree problems LATIN '95: Theoretical Informatics	2022-08-16	Paper
A deterministic parsing algorithm for ambiguous regular expressions Acta Informatica	2021-06-23	Paper
A benchmark production tool for regular expressions	2020-05-06	Paper
Fast deterministic parsers for transition networks Acta Informatica	2018-10-09	Paper
A temporal logic for micro- and macro-step-based real-time systems: foundations and applications Theoretical Computer Science	2016-08-01	Paper
\textit{BSP}: a parsing tool for ambiguous regular expressions Implementation and Application of Automata	2015-09-23	Paper
From ambiguous regular expressions to deterministic parsing automata Implementation and Application of Automata	2015-09-23	Paper
Complexity of extended vs. classic LR parsers Descriptional Complexity of Formal Systems	2014-08-07	Paper
Shift-reduce parsers for transition networks Language and Automata Theory and Applications	2014-03-31	Paper
Formal languages and compilation Texts in Computer Science	2013-12-05	Paper
Modeling time in computing. Monographs in Theoretical Computer Science. An EATCS Series	2012-10-11	Paper
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time Theoretical Aspects of Computing - ICTAC 2008	2009-01-27	Paper
Model Checking Temporal Metric Specifications with Trio2Promela Lecture Notes in Computer Science	2008-07-01	Paper
Automated compositional proofs for real-time systems Theoretical Computer Science	2007-05-23	Paper
Fundamental Approaches to Software Engineering Lecture Notes in Computer Science	2005-09-13	Paper
Dealing with zero-time transitions in axiom systems. Information and Computation	2003-01-14	Paper
scientific article; zbMATH DE number 1536566 (Why is no real title available?)	2000-11-28	Paper
scientific article; zbMATH DE number 1222099 (Why is no real title available?)	1998-11-11	Paper
A theory of implementation and refinement in timed Petri nets Theoretical Computer Science	1998-08-13	Paper
On the approximability of some Maximum Spanning Tree Problems Theoretical Computer Science	1998-07-22	Paper
A short note on the approximability of the maximum leaves spanning tree problem Information Processing Letters	1996-02-26	Paper

Research outcomes over time

This page was built for person: Angelo Morzenti