Experimental results and Open problems

Frédérique Bassino

Description

Introduction Random generation Experimental results and Open problems Random generation of deterministic automata Frederique Bassino Institut Gaspard-Monge Universite de Marne-la-Vallee Joint work with Cyril Nicaud Frederique Bassino Random generation of deterministic automata

• red


• automata into


• finite automata


• random generation


• languages recognized


• red most signicant


• regular languages

Sujets

• Université
• Finite-state machine
• Regular language

Informations

• Publié par: profil-urra-2012
• Nombre de lectures: 5
• Langue: English

Extrait

Fre´de´riqueBassino JointworkwithCyrilNicaud InstitutGaspard-Monge Universite´deMarne-la-Valle´e Randomgenerationofdeterministicautomata atamotuacitsinimretedfonoitarenegmodnaRonissaBeuqire´de´rF smelborpnepOdnastluserlatnemirepxE noitarenegmodnaR noitcudortnI

atamotuacitsinimretedfonoitarenegmodnaRonissaBeuqire´de´rF atamotuaelbisseccA atamotualaminiM atamotuaetiniF smelborpnepOdnastluserlat Finiteautomata Uniformrandomgeneration Bijectionstotransformdeterministicautomataintosetpartitions Boltzmannsamplerstogeneratesetpartitions Complexity Experimentalresultsandopenproblems nemirepxE noitarenegmodnaR noitcudortnI

atamotuaelbisseccA atamotualaminiM atamotuaetiniF smelborpnepOdnastluserlatnemirepxE noitarenegmodnaR noitcudortnI Finiteautomata:modelsofdecisionalgorithmsthatrequirea nitememory. Examples: Totestwhetherabinarynumberisamultipleof3ornot. Buttotestwhetherawordcanbedecomposedas1 n 0 n requiresto rememberthenumbersof0'sand1'salreadyred. Inpractice Patternmatching Lexicalanalysisofatext atamotuacitsinimretedfonoitarenegmodnaRonissaBeuqire´de´rF