120 likes | 193 Views
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
E N D
LOCAL TESTABILITY Un concetto ricco di suggestioni e un dialogo a distanza con Stefano
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.
Un testo fondamentale Robert McNaughton and Seymour Papert COUNTER-FREE AUTOMATA The MIT Press, 1971 Sviluppa la teoria matematica di Non-CountingProperty Local Testability
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
Two-DimensionalLanguages Stefano con Matteo Pradella, Alessandra Cherubini Pierluigi San Pietro Tilerewritinggrammars RegionalTilegrammars A. R. con Dora Giammarresi Finite-State Recognizability by Tiling Systems
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
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
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
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
Stefano, quante altre idee innovative ci proporrai ancora, più o meno ispirate alla Local Testability?