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
Hilfe
Suche: Author="Parente, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Power of interconnections and of nondeterminism in regular
Y
-tree systolic automata
E. Fachini
,
J. Gruska
,
M. Napoli
,
D. Parente
Math. Systems Theory
28
(3), 1995, pp. 245-266
State complexity of SBTA languages
J. Gruska
,
A. Monti
,
M. Napoli
,
D. Parente
Lecture Notes in Computer Science
911
, 1995, pp. 346-357
Languages accepted by systolic Y-tree automata: structural characterizations
E. Fachini
,
A. Monti
,
M. Napoli
,
D. Parente
Acta Informatica
29
, 1992, pp. 761-778
Systolic Y-tree automata: Closure properties and decision problems
E. Fachini
,
A. Monti
,
M. Napoli
,
D. Parente
Lecture Notes in Computer Science
529
, 1991, pp. 210-219
Systolic tree with base automata
A. Monti
,
D. Parente
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 221-236
Comparison results for particular systolic tree automata
A. Monti
,
D. Parente
Proceedings of the 1st Italian Conference on Algorithms and Complexity, CIAC'1990 (Rome, Italy, October 1-2, 1990)
, 1990, pp. 172-187