default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicoletta Sabadini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Elena Di Lavore
, Alessandro Gianola, Mario Román, Nicoletta Sabadini, Pawel Sobocinski:
Span(Graph): a canonical feedback algebra of open transition systems. Softw. Syst. Model. 22(2): 495-520 (2023)- 2021
- [j18]Alessandra Cherubini, Nicoletta Sabadini, Simone Tini:
Theoretical Computer Science in Italy. Theor. Comput. Sci. 864: 138 (2021) - [c23]Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini, Pawel Sobocinski:
A Canonical Algebra of Open Transition Systems. FACS 2021: 63-81 - 2020
- [j17]Alessandro Gianola, Stefano Kasangian, Desiree Manicardi, Nicoletta Sabadini, Filippo Schiavio, Simone Tini:
CospanSpan(Graph): a Compositional Description of the Heart System. Fundam. Informaticae 171(1-4): 221-237 (2020) - [c22]Alessandro Gianola, Stefano Kasangian, Desiree Manicardi, Nicoletta Sabadini, Simone Tini:
Compositional Modeling of Biological Systems in CospanSpan(Graph). ICTCS 2020: 61-66 - [i5]Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini, Pawel Sobocinski:
A canonical algebra of open transition systems. CoRR abs/2010.10069 (2020)
2010 – 2019
- 2019
- [e1]Alessandra Cherubini, Nicoletta Sabadini, Simone Tini:
Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019. CEUR Workshop Proceedings 2504, CEUR-WS.org 2019 [contents] - 2017
- [j16]Nicoletta Sabadini, Filippo Schiavio, Robert F. C. Walters:
On the geometry and algebra of networks with state. Theor. Comput. Sci. 664: 144-163 (2017) - [c21]Alessandro Gianola, Stefano Kasangian, Nicoletta Sabadini:
Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks. CALCO 2017: 2:1-2:17 - 2015
- [j15]D. Maglia, Nicoletta Sabadini, Robert F. C. Walters:
Blocked-Braid Groups. Appl. Categorical Struct. 23(1): 53-61 (2015) - 2014
- [j14]Giancarlo Mauri, Nicoletta Sabadini:
Obituary Alberto Bertoni (1946-2014). Bull. EATCS 113 (2014) - 2011
- [j13]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The Compositional Construction of Markov Processes. Appl. Categorical Struct. 19(1): 425-437 (2011) - [j12]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes II. RAIRO Theor. Informatics Appl. 45(1): 117-142 (2011) - [i4]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Tangled Circuits. CoRR abs/1110.0715 (2011)
2000 – 2009
- 2009
- [c20]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes. ICTCS 2009: 91-98 - [c19]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
An Algebra of Automata That Includes Both Classical and Quantum Entities. QPL@MFPS 2009: 263-272 - [i3]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes. CoRR abs/0901.2434 (2009) - [i2]Luisa 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
- [c18]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Calculating Colimits Compositionally. Concurrency, Graphs and Models 2008: 581-592 - 2004
- [j11]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Minimisation and minimal realisation in Span(Graph). Math. Struct. Comput. Sci. 14(5): 685-714 (2004) - 2003
- [c17]Nicoletta Sabadini, Robert F. C. Walters:
Hierarchical Automata and P-systems. CATS 2003: 5-19 - [c16]Alessandra Cherubini, Nicoletta Sabadini, Robert F. C. Walters:
Timing in the Cospan-Span Model. COMETA 2003: 81-97 - [c15]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Compositional Minimization in Span(Graph): Some Examples. COMETA 2003: 181-197 - 2002
- [j10]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Feedback, trace and fixed-point semantics. RAIRO Theor. Informatics Appl. 36(2): 181-194 (2002) - 2001
- [c14]Daniela Besozzi, Claudio Zandron, Giancarlo Mauri, Nicoletta Sabadini:
P Systems with Gemmation of Mobile Membranes. ICTCS 2001: 136-153 - [c13]Fabio Gadducci, Piergiulio Katis, Ugo Montanari, Nicoletta Sabadini, Robert F. C. Walters:
Comparing cospan-spans and tiles via a Hoare-style process calculus. TOSCA 2001: 157-176 - 2000
- [c12]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
A Formalization of the IWIM Model. COORDINATION 2000: 267-283 - [i1]R. Gates, Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
On Automata with Boundary. CoRR cs.DC/0002008 (2000)
1990 – 1999
- 1998
- [j9]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Minimal Realization in Bicategories of Automata. Math. Struct. Comput. Sci. 8(2): 93-116 (1998) - 1997
- [c11]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Span(Graph): A Categorial Algebra of Transition Systems. AMAST 1997: 307-321 - [c10]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Representing Place/Transition Nets in Span(Graph). AMAST 1997: 322-336 - 1996
- [j8]Stephen L. Bloom, Nicoletta Sabadini, Robert F. C. Walters:
Matrices, machines and behaviors. Appl. Categorical Struct. 4(4): 343-360 (1996) - [j7]Nicoletta Sabadini, Sebastiano Vigna, Robert F. C. Walters:
A Note on Recursive Functions. Math. Struct. Comput. Sci. 6(2): 127-139 (1996) - [j6]S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini:
Probabilistic Asynchronous Automata. Math. Syst. Theory 29(1): 5-31 (1996) - 1995
- [p2]Alberto Bertoni, Massimiliano Goldwurm, Giancarlo Mauri, Nicoletta Sabadini:
Counting Techniques for Inclusion, Equivalence and Membership Problems. The Book of Traces 1995: 131-163 - 1994
- [j5]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
- [c9]Nicoletta Sabadini, Sebastiano Vigna, Robert F. C. Walters:
A Notion of Refinement for Automata. AMAST 1993: 325-332 - 1992
- [j4]Alberto Bertoni, Paolo Massazza, Nicoletta Sabadini:
Holonomic Generating Functions and Context Free Languages. Int. J. Found. Comput. Sci. 3(2): 181-191 (1992) - [p1]Paola Bonizzoni, Giancarlo Mauri, Giovanni Pighizzini, Nicoletta Sabadini:
Recognizing sets of labelled acyclic graphs. Tree Automata and Languages 1992: 201-224 - 1991
- [j3]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)
1980 – 1989
- 1989
- [j2]Alberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini:
Membership Problems for Regular and Context-Free Trace Languages. Inf. Comput. 82(2): 135-150 (1989) - 1988
- [j1]Alberto Bertoni, Nicoletta Sabadini:
Generating functions of trace languages. Bull. EATCS 35: 106-112 (1988) - [c8]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 - 1987
- [c7]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Computing the Counting Function of Context-Free Languages. STACS 1987: 169-179 - 1986
- [c6]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Analysis of a Class of Algorithms for Problems on Trace Languages. AAECC 1986: 202-214 - [c5]Alberto Bertoni, Massimiliano Goldwurm, Giancarlo Mauri, Nicoletta Sabadini:
Parallel Algorithms and the Classification of Problems. WOPPLOT 1986: 206-226 - 1982
- [c4]Alberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini:
Equivalence and Membership Problems for Regular Trace Languages. ICALP 1982: 61-71 - 1981
- [c3]Giancarlo Mauri, Nicoletta Sabadini:
A # P-Complete Problem over Arithmetical Trees. CAAP 1981: 308-315 - [c2]Alberto Bertoni, Marco Brambilla, Giancarlo Mauri, Nicoletta Sabadini:
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages. MFCS 1981: 205-215 - [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
