BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20230117T100000
DTEND;TZID=Europe/Paris:20230117T110000
DTSTAMP:20260423T181951
CREATED:20221216T135318Z
LAST-MODIFIED:20230109T091233Z
UID:11031-1673949600-1673953200@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Florent Koechlin (LORIA\, Nancy) « Two new criteria to prove the inherent ambiguity of bounded context-free languages »
DESCRIPTION:A context-free language is inherently ambiguous if any grammar that recognizes it is ambiguous\, i.e. there exists a word that is generated in two different ways. Deciding the inherent ambiguity of a context-free language is a difficult problem\, undecidable in general. The first examples of inherently ambiguous languages were discovered in the 1960s\, using iteration techniques on derivation trees. They belonged to a particular subfamily of context-free languages\, the bounded context-free languages. \nAlthough they made it possible to prove the inherent ambiguity of several languages\, as for example the language L = a^n b^m c^p with n=m or m=p\, iteration techniques are still very laborious to implement\, and are very specific to the language studied\, even sometimes unadapted to the studied language. For instance\, the proof of inherent ambiguity of the language L completely collapses by replacing the constraint « n=m or m=p » by « n≠m or m≠p ». \nIn this talk\, I will present two new criteria based on generating series that allow us to prove the inherent ambiguity of bounded languages. These languages\, which have a rational generating series\, resisted both the classical iteration techniques developed in the 1960’s and the analytic methods introduced by Philippe Flajolet in 1987.
URL:https://www.greyc.fr/event/seminaire-algorithmique-florent-koechlin-loria-nancy/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,Séminaire Algo
END:VEVENT
END:VCALENDAR