BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Stefano Crespi Reghizzi (Politecnico di Milano and CNR-IEIIT)
DTSTART:20241218T140000Z
DTEND:20241218T150000Z
DTSTAMP:20260423T021310Z
UID:FLAT/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/FLAT/6/">Cro
 sswords of formal languages</a>\nby Stefano Crespi Reghizzi (Politecnico d
 i Milano and CNR-IEIIT) as part of One FLAT World Seminar\n\n\nAbstract\nT
 he definition of crosswords as row-column combinations of words over an al
 phabet is\napplied to regular and context-free (CF) languages\, thus produ
 cing picture (2D)\nlanguages. The letter-to-letter projection of regular c
 rosswords coincides with the\nwell-known family of (tiling system) recogni
 zable pictures. Recent results for the CF case\,\nand especially for the D
 yck languages\, are presented\, that culminate in a generalized\nChomsky-S
 chützenberger Theorem (CST) for CF crosswords. CST represents the family\
 nof pictures defined by projection of context-free crosswords\, while it f
 ully characterizes the\nmore general family where the crossword is applied
  to CF languages over two alphabets\,\nwhose Cartesian product becomes the
  picture alphabet. Dyck crosswords exhibit a rich\nspectrum of 2D patterns
  that combine the syntax trees of their CF components. Simpler\nDyck subfa
 milies generalize in 2D the well-nesting property of Dyck words.\n
LOCATION:https://researchseminars.org/talk/FLAT/6/
END:VEVENT
END:VCALENDAR