( en | de | ru )

 

Disambiguation of "Sabadini, Nicoletta"

Author of the publication

copydeleteadd this publication to your clipboard
A Notion of Refinement for Automata.

, , and . AMAST, page 325-332. Springer, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicoletta Kiefer

Nicoletta Grillo

Nicoletta Vieler

Nicoletta Laue

Nicoletta Poulet

 

Other publications of authors with the same name

Calculating Colimits Compositionally., , and . Concurrency, Graphs and Models, volume 5065 of Lecture Notes in Computer Science, page 581-592. Springer, (2008)P Systems with Gemmation of Mobile Membranes., , , and . ICTCS, volume 2202 of Lecture Notes in Computer Science, page 136-153. Springer, (2001)A Formalization of the IWIM Model., , and . COORDINATION, volume 1906 of Lecture Notes in Computer Science, page 267-283. Springer, (2000)Membership Problems for Regular and Context-Free Trace Languages, , and . Inf. Comput., 82 (2): 135-150 (August 1989)A Canonical Algebra of Open Transition Systems., , , , and . FACS, volume 13077 of Lecture Notes in Computer Science, page 63-81. Springer, (2021)Computing the Counting Function of Context-Free Languages., , and . STACS, volume 247 of Lecture Notes in Computer Science, page 169-179. Springer, (1987)Equivalence and Membership Problems for Regular Trace Languages., , and . ICALP, volume 140 of Lecture Notes in Computer Science, page 61-71. Springer, (1982)A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines, , and . STOC, page 168-176. ACM, (1981)Parallel Algorithms and the Classification of Problems., , , and . WOPPLOT, volume 253 of Lecture Notes in Computer Science, page 206-226. Springer, (1986)On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages., , and . STACS, volume 294 of Lecture Notes in Computer Science, page 334-345. Springer, (1988)