Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="San Pietro, Pierluigi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A logical characterization of timed (non-)regular languages
Marcello M. Bersani
,
Matteo Rossi
,
Pierluigi San Pietro
Lecture Notes in Computer Science
8634
, 2014, pp. 75-86
Dense-choice counter machines revisited
Florent Bouchy
,
Alain Finkel
,
Pierluigi San Pietro
Theoretical Computer Science
542
, 2014, pp. 17-31
Strict local testability with consensus equals regularity, and other properties
Stefano Crespi Reghizzi
,
Pierluigi San Pietro
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 747-763
From regular to strictly locally testable languages
Stefano Crespi Reghizzi
,
Pierluigi San Pietro
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1711-1727
Picture languages: Tiling systems versus tile rewriting grammars
Alessandra Cherubini
,
Stefano Crespi Reghizzi
,
Matteo Pradella
,
Pierluigi San Pietro
Theoretical Computer Science
356
(1-2), 2006, pp. 90-103
Real-counter automata and their decision problems
Zhe Dang
,
Oscar H. Ibarra
,
Pierluigi San Pietro
,
Gaoyan Xie
Lecture Notes in Computer Science
3328
, 2004, pp. 198-210
Automatic verification of multi-queue discrete timed automata
Pierluigi San Pietro
,
Zhe Dang
Lecture Notes in Computer Science
2697
, 2003, pp. 159-171
Associative language descriptions
Alessandra Cherubini
,
Stefano Crespi Reghizzi
,
Pierluigi San Pietro
Theoretical Computer Science
270
(1-2), 2002, pp. 463-491
Liveness verification of reversal-bounded multicounter machines with a free counter
Zhe Dang
,
Oscar H. Ibarra
,
Pierluigi San Pietro
Lecture Notes in Computer Science
2245
, 2001, pp. 132-143
On Presburger liveness of discrete timed automata
Zhe Dang
,
Pierluigi San Pietro
,
Richard A. Kemmerer
Lecture Notes in Computer Science
2010
, 2001, pp. 132-143
A polynomial-time parsing algorithm for
K
-depth languages
Alessandra Cherubini
,
Pierluigi San Pietro
Journal of Computer and System Sciences
52
(1), 1996, pp. 61-79