The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicoletta Sabadini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  29. Calculating Colimits Compositionally. [Citation Graph (, )][DBLP]


  30. The compositional construction of Markov processes [Citation Graph (, )][DBLP]


  31. An algebra of automata which includes both classical and quantum entities [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002