Massimiliano Goldwurm
Massimiliano Goldwurm
UniversitÓ degli Studi di Milano, Dipartimento di Matematica
Verified email at unimi.it - Homepage
Title
Cited by
Cited by
Year
Timed automata with periodic clock constraints
C Choffrut, M Goldwurm
Journal of Automata, Languages and Combinatorics 5 (4), 371-404, 2000
682000
Clique polynomials have a unique root of smallest modulus
M Goldwurm, M Santini
Information Processing Letters 75 (3), 127-132, 2000
522000
The complexity of computing the number of strings of given length in context-free languages
A Bertoni, M Goldwurm, N Sabadini
Theoretical Computer Science 86 (2), 325-342, 1991
351991
Random generation of words in an algebraic language in linear binary space
M Goldwurm
Information Processing Letters 54 (4), 229-233, 1995
301995
On the number of occurrences of a symbol in words of regular languages
A Bertoni, C Choffrut, M Goldwurm, V Lonati
Theoretical Computer Science 302 (1-3), 431-456, 2003
272003
Random generation and approximate counting of ambiguously described combinatorial structures
A Bertoni, M Goldwurm, M Santini
Annual Symposium on Theoretical Aspects of Computer Science, 567-580, 2000
192000
Analysis of algorithms for the recognition of rational and context-free trace languages
A Avellone, M Goldwurm
RAIRO-Theoretical Informatics and Applications 32 (4-6), 141-152, 1998
171998
Counting techniques for inclusion, equivalence and membership problems
A Bertoni, M Goldwurm, G Mauri, N Sabadini
The book of traces, 131-163, 1995
171995
Size constrained distance clustering: separation properties and some complexity results
A Bertoni, M Goldwurm, J Lin, F SaccÓ
Fundamenta Informaticae 115 (1), 125-139, 2012
132012
Rational transductions and complexity of counting problems
C Choffrut, M Goldwurm
Mathematical systems theory 28 (5), 437-450, 1995
131995
Interacting with an artificial partner: modeling the role of emotional aspects
I Cattinelli, M Goldwurm, NA Borghese
Biological cybernetics 99 (6), 473-489, 2008
122008
Counting problems and algebraic formal power series in noncommuting variables
A Bertoni, M Goldwurm, P Massazza
Information processing letters 34 (3), 117-121, 1990
121990
Computing the counting function of context-free languages
A Bertoni, M Goldwurm, N Sabadini
Annual Symposium on Theoretical Aspects of Computer Science, 169-179, 1987
121987
The complexity of unary tiling recognizable picture languages: Nondeterministic and unambiguous cases
A Bertoni, M Goldwurm, V Lonati
Fundamenta Informaticae 91 (2), 231-249, 2009
112009
Random generation for finitely ambiguous context-free languages
A Bertoni, M Goldwurm, M Santini
RAIRO-Theoretical Informatics and Applications 35 (6), 499-512, 2001
112001
Ranking and formal power series
A Bertoni, D Bruschi, M Goldwurm
Theoretical computer science 79 (1), 25-35, 1991
111991
Analysis of a class of algorithms for problems on trace languages
A Bertoni, M Goldwurm, N Sabadini
International Conference on Applied Algebra, Algebraic Algorithms, and Errorá…, 1986
111986
On the complexity of unary tiling-recognizable picture languages
A Bertoni, M Goldwurm, V Lonati
Annual Symposium on Theoretical Aspects of Computer Science, 381-392, 2007
102007
Determinants and M÷bius functions in trace monoids
C Choffrut, M Goldwurm
Discrete mathematics 194 (1-3), 239-247, 1999
91999
Probabilistic estimation of the number of prefixes of a trace
M Goldwurm
Theoretical computer science 92 (2), 249-268, 1992
91992
The system can't perform the operation now. Try again later.
Articles 1–20