Nicoletta Sabadini
Orcid: 0000-0003-2846-4475
According to our database1,
Nicoletta Sabadini
authored at least 46 papers
between 1981 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
1
1
1
1
1
1
1
1
3
1
1
1
1
1
3
1
1
1
1
1
1
1
1
1
1
3
2
1
2
1
1
1
2
1
3
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Softw. Syst. Model., April, 2023
2021
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021
2020
Fundam. Informaticae, 2020
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020
2017
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017
2015
2014
2011
RAIRO Theor. Informatics Appl., 2011
2009
Proceedings of the 6th International Workshop on Quantum Physics and Logic, 2009
2008
2004
Math. Struct. Comput. Sci., 2004
2003
Proceedings of the Computing: the Australasian Theory Symposiumm, 2003
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003
2002
2001
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001
2000
Proceedings of the Coordination Languages and Models, 4th International Conference, 2000
1998
1997
Proceedings of the Algebraic Methodology and Software Technology, 1997
Proceedings of the Algebraic Methodology and Software Technology, 1997
1996
1995
Proceedings of the Book of Traces, 1995
1994
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages
Inf. Comput., February, 1994
1993
A Notion of Refinement for Automata.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993
1992
Int. J. Found. Comput. Sci., 1992
Recognizing sets of labelled acyclic graphs.
Proceedings of the Tree Automata and Languages., 1992
1991
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
Theor. Comput. Sci., 1991
1989
Inf. Comput., August, 1989
1988
Generating functions of trace languages.
Bull. EATCS, 1988
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages.
Proceedings of the STACS 88, 1988
1987
Proceedings of the STACS 87, 1987
1986
Proceedings of the WOPPLOT 86, 1986
Proceedings of the Applied Algebra, 1986
1982
Proceedings of the Automata, 1982
1981
A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981