| 2009 |
| 32 | EE | L. de Francesco Albasini,
Nicoletta Sabadini,
Robert F. C. Walters:
The compositional construction of Markov processes
CoRR abs/0901.2434: (2009) |
| 31 | EE | L. de Francesco Albasini,
Nicoletta Sabadini,
Robert F. C. Walters:
An algebra of automata which includes both classical and quantum entities
CoRR abs/0901.4754: (2009) |
| 2008 |
| 30 | EE | Robert D. Rosebrugh,
Nicoletta Sabadini,
Robert F. C. Walters:
Calculating Colimits Compositionally.
Concurrency, Graphs and Models 2008: 581-592 |
| 2004 |
| 29 | EE | Piergiulio Katis,
Nicoletta Sabadini,
Robert F. C. Walters:
Compositional Minimization in Span(Graph): Some Examples.
Electr. Notes Theor. Comput. Sci. 104: 181-197 (2004) |
| 28 | EE | Alessandra Cherubini,
Nicoletta Sabadini,
Robert F. C. Walters:
Timing in the Cospan-Span Model.
Electr. Notes Theor. Comput. Sci. 104: 81-97 (2004) |
| 27 | EE | Robert D. Rosebrugh,
Nicoletta Sabadini,
Robert F. C. Walters:
Minimisation and minimal realisation in Span(Graph).
Mathematical Structures in Computer Science 14(5): 685-714 (2004) |
| 2003 |
| 26 | EE | Nicoletta Sabadini,
Robert F. C. Walters:
Hierarchical Automata and P-systems.
Electr. Notes Theor. Comput. Sci. 78: (2003) |
| 2002 |
| 25 | EE | Piergiulio Katis,
Nicoletta Sabadini,
Robert F. C. Walters:
Feedback, trace and fixed-point semantics.
ITA 36(2): 181-194 (2002) |
| 2001 |
| 24 | EE | Daniela Besozzi,
Claudio Zandron,
Giancarlo Mauri,
Nicoletta Sabadini:
P Systems with Gemmation of Mobile Membranes.
ICTCS 2001: 136-153 |
| 23 | EE | Fabio Gadducci,
Piergiulio Katis,
Ugo Montanari,
Nicoletta Sabadini,
Robert F. C. Walters:
Comparing cospan-spans and tiles via a Hoare-style process calculus.
Electr. Notes Theor. Comput. Sci. 62: (2001) |
| 2000 |
| 22 | EE | Piergiulio Katis,
Nicoletta Sabadini,
Robert F. C. Walters:
A Formalization of the IWIM Model.
COORDINATION 2000: 267-283 |
| 21 | EE | R. Gates,
Piergiulio Katis,
Nicoletta Sabadini,
Robert F. C. Walters:
On Automata with Boundary
CoRR cs.DC/0002008: (2000) |
| 1998 |
| 20 | | Robert D. Rosebrugh,
Nicoletta Sabadini,
Robert F. C. Walters:
Minimal Realization in Bicategories of Automata.
Mathematical Structures in Computer Science 8(2): 93-116 (1998) |
| 1997 |
| 19 | | Piergiulio Katis,
Nicoletta Sabadini,
Robert F. C. Walters:
Span(Graph): A Categorial Algebra of Transition Systems.
AMAST 1997: 307-321 |
| 18 | | Piergiulio Katis,
Nicoletta Sabadini,
Robert F. C. Walters:
Representing Place/Transition Nets in Span(Graph).
AMAST 1997: 322-336 |
| 1996 |
| 17 | | Nicoletta Sabadini,
Sebastiano Vigna,
Robert F. C. Walters:
A Note on Recursive Functions.
Mathematical Structures in Computer Science 6(2): 127-139 (1996) |
| 16 | | S. Jesi,
Giovanni Pighizzini,
Nicoletta Sabadini:
Probabilistic Asynchronous Automata.
Mathematical Systems Theory 29(1): 5-31 (1996) |
| 1994 |
| 15 | | Danilo Bruschi,
Giovanni Pighizzini,
Nicoletta Sabadini:
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages
Inf. Comput. 108(2): 262-285 (1994) |
| 1993 |
| 14 | | Nicoletta Sabadini,
Sebastiano Vigna,
Robert F. C. Walters:
A Notion of Refinement for Automata.
AMAST 1993: 325-332 |
| 1992 |
| 13 | | Paola Bonizzoni,
Giancarlo Mauri,
Giovanni Pighizzini,
Nicoletta Sabadini:
Recognizing sets of labelled acyclic graphs.
Tree Automata and Languages 1992: 201-224 |
| 12 | | Alberto Bertoni,
Paolo Massazza,
Nicoletta Sabadini:
Holonomic Generating Functions and Context Free Languages.
Int. J. Found. Comput. Sci. 3(2): 181-191 (1992) |
| 1991 |
| 11 | | Alberto Bertoni,
Massimiliano Goldwurm,
Nicoletta Sabadini:
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
Theor. Comput. Sci. 86(2): 325-342 (1991) |
| 1989 |
| 10 | | Alberto Bertoni,
Giancarlo Mauri,
Nicoletta Sabadini:
Membership Problems for Regular and Context-Free Trace Languages
Inf. Comput. 82(2): 135-150 (1989) |
| 1988 |
| 9 | | Danilo Bruschi,
Giovanni Pighizzini,
Nicoletta Sabadini:
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages.
STACS 1988: 334-345 |
| 8 | | Alberto Bertoni,
Nicoletta Sabadini:
Generating functions of trace languages.
Bulletin of the EATCS 35: 106-112 (1988) |
| 1987 |
| 7 | | Alberto Bertoni,
Massimiliano Goldwurm,
Nicoletta Sabadini:
Computing the Counting Function of Context-Free Languages.
STACS 1987: 169-179 |
| 1986 |
| 6 | | Alberto Bertoni,
Massimiliano Goldwurm,
Nicoletta Sabadini:
Analysis of a Class of Algorithms for Problems on Trace Languages.
AAECC 1986: 202-214 |
| 5 | | Alberto Bertoni,
Massimiliano Goldwurm,
Giancarlo Mauri,
Nicoletta Sabadini:
Parallel Algorithms and the Classification of Problems.
WOPPLOT 1986: 206-226 |
| 1982 |
| 4 | | Alberto Bertoni,
Giancarlo Mauri,
Nicoletta Sabadini:
Equivalence and Membership Problems for Regular Trace Languages.
ICALP 1982: 61-71 |
| 1981 |
| 3 | | Giancarlo Mauri,
Nicoletta Sabadini:
A # P-Complete Problem over Arithmetical Trees.
CAAP 1981: 308-315 |
| 2 | | Alberto Bertoni,
M. Brambilla,
Giancarlo Mauri,
Nicoletta Sabadini:
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.
MFCS 1981: 205-215 |
| 1 | | Alberto Bertoni,
Giancarlo Mauri,
Nicoletta Sabadini:
A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines
STOC 1981: 168-176 |