710 research outputs found
Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic
In this paper we survey some surprising connections between group theory, the
theory of automata and formal languages, the theory of ends, infinite games of
perfect information, and monadic second-order logic
Clearing Restarting Automata
RestartovacĂ automaty byly navrĹľeny jako model pro redukÄŤnĂ analĂ˝zu, která pĹ™edstavuje lingvisticky motivovanou metodu pro kontrolu korektnosti vÄ›ty. CĂlem práce je studovat omezenÄ›jšà modely restartovacĂch automatĹŻ, kterĂ© smĂ vymazat podĹ™etÄ›zec nebo jej nahradit speciálnĂm pomocnĂ˝m symbolem, jenom na základÄ› omezenĂ©ho lokálnĂho kontextu tohoto podĹ™etÄ›zce. Tyto restartovacĂ automaty se nazĂ˝vajĂ clearing restarting automata. V práci jsou taktĂ©Ĺľ zkoumány uzávÄ›rovĂ© vlastnosti tÄ›chto automatĹŻ, jejich vztah k Chomskeho hierarchii a moĹľnosti uÄŤenĂ tÄ›chto automatĹŻ na základÄ› pozitivnĂch a negativnĂch pĹ™ĂkladĹŻ.Restarting automata were introduced as a model for analysis by reduction which is a linguistically motivated method for checking correctness of a sentence. The goal of the thesis is to study more restricted models of restarting automata which based on a limited context can either delete a substring of the current content of its tape or replace a substring by a special symbol, which cannot be overwritten anymore, but it can be deleted later. Such restarting automata are called clearing restarting automata. The thesis investigates the properties of clearing restarting automata, their relation to Chomsky hierarchy and possibilities for machine learning of such automata from positive and negative samples.Department of Software and Computer Science EducationKatedra softwaru a vĂ˝uky informatikyFaculty of Mathematics and PhysicsMatematicko-fyzikálnĂ fakult
- …