1 / 12

LOCAL TESTABILITY

LOCAL TESTABILITY. Un concetto ricco di suggestioni e u n dialogo a distanza con Stefano. LT appare in svariati contesti. Medvedev theorem Comsky-Schutzenberger theorem Linguistics Learning models and inductive inference DNA and Splicing S ystems

tamar
Télécharger la présentation

LOCAL TESTABILITY

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LOCAL TESTABILITY Un concetto ricco di suggestioni e un dialogo a distanza con Stefano

  2. LT appare in svariati contesti • Medvedevtheorem • Comsky-Schutzenbergertheorem • Linguistics • Learning models and inductiveinference • DNA and SplicingSystems • Brain models for languagerecognition • Systems of finite type in Symbolic Dynamics • Recognizable 2D-languages • Aural pattern recognitioncapabilities in humans and animals • Theory of semigroups • etc.

  3. Un testo fondamentale Robert McNaughton and Seymour Papert COUNTER-FREE AUTOMATA The MIT Press, 1971 Sviluppa la teoria matematica di Non-CountingProperty Local Testability

  4. Negli anni 70 S. Crespi-Reghizzi Non-Countinglanguages and learning Proc.NatoAdv. Study on Computer Learning Processes, 1974 S. Crespi-Reghizzi, G. Guida, D. Mandrioli, Non-countingcontext-free languages, J. ACM 25, 1978 A. Restivo Codes and aperiodiclanguages LNCS 2, 1973 A. Restivo On a question of McNaughton and Papert Information and Control 25,1974

  5. Two-DimensionalLanguages Stefano con Matteo Pradella, Alessandra Cherubini Pierluigi San Pietro Tilerewritinggrammars RegionalTilegrammars A. R. con Dora Giammarresi Finite-State Recognizability by Tiling Systems

  6. Altre ricerche ispirate, o con riferimento, a LT Stefano • Associative Language descriptions • Consensuallanguages • A generalizatio of Medvedev’stheorem A. R. • Symbolic Dynamics and Codes • Combinatorics of MinimalForbiddenWords

  7. Associative Language Descriptions A combination of locallytestable and constituentstructuremodels. • Cherubini, S. Crespi-Reghizzi, P. San Pietro Languagesbased on structurallocaltestability S. Crespi-Reghizzi, V. Braitenberg Toward a brain compatibletheory of syntaxbased on localtestability S. Crespi-Reghizzi, M. Pradella, P. San Pietro Associative definition of programminglanguages

  8. A generalization of Medvedev’stheorem S. Crespi-Reghizzi, P. San Pietro From Regular languages to strictlylocallytestablelanguages Investigates the relationshipbetween the width of the slidingwindow and the alphabetic ratio

  9. ConsensualLanguages A languagedefinitiondevicebased on agreemen, or consensus, betweensimilarwords S. Crespi-Reghizzi, P. San Pietro Languagesdefined by consensualcomputations S. Crespi-Reghizzi, P. San Pietro Strictlocaltestability with consensusequalsregularity

  10. Stefano, quante altre idee innovative ci proporrai ancora, più o meno ispirate alla Local Testability?

More Related