BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Hungary
1 × Israel
1 × Italy
1 × Japan
2 × Spain
2 × USA
Collaborated with:
G.Mauri N.Jonoska C.d.Felice R.Zizza ∅ C.Ferretti A.R.S.Mary P.Barone G.D.Vedova N.Beerenwinkel S.Beretta R.Dondi Y.Pirola
Talks about:
languag (4) splice (4) regular (3) problem (2) generat (2) system (2) reflex (2) decis (2) experiment (1) supersequ (1)

Person: Paola Bonizzoni

DBLP DBLP: Bonizzoni:Paola

Contributed to:

LATA 20142014
DLT 20112011
LATA 20092009
DLT 20062006
DLT 20032003
DLT 20022002
SAC 20012001
ICALP 19941994

Wrote 8 papers:

LATA-2014-BeerenwinkelBBDP #graph
Covering Pairs in Directed Acyclic Graphs (NB, SB, PB, RD, YP), pp. 126–137.
DLT-2011-BonizzoniJ #constant
Regular Splicing Languages Must Have a Constant (PB, NJ), pp. 82–92.
LATA-2009-BonizzoniFMM
Picture Languages Generated by Assembling Tiles (PB, CF, ARSM, GM), pp. 224–235.
DLT-2006-BonizzoniM #reflexive
A Decision Procedure for Reflexive Regular Splicing Languages (PB, GM), pp. 315–326.
DLT-2003-BonizzoniFMZ #finite #reflexive #regular expression
Regular Languages Generated by Reflexive Finite Splicing Systems (PB, CdF, GM, RZ), pp. 134–145.
DLT-2002-BonizzoniFMZ #linear #problem
Decision Problems for Linear and Circular Splicing Systems (PB, CdF, GM, RZ), pp. 78–92.
SAC-2001-BaroneBVM #algorithm #analysis #approximate #problem
An approximation algorithm for the shortest common supersequence problem: an experimental analysis (PB, PB, GDV, GM), pp. 56–60.
ICALP-1994-Bonizzoni #bound
A Tight Lower Bound for Primitivity in k-Structures (PB), pp. 556–567.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.