Elaborar un plan que oriente la búsqueda, el análisis y la síntesis de la información pertinente para resolver sus preguntas. We motivate the conjecture that weak MSO modulo bisimulation collapses inside MSO and well-founded MSO. Esta competencia hace referencia, específicamente, a que el estudiante esté en capacidad de: Formular preguntas que expresen su necesidad de información e identificar qué requiere indagar para resolverlas. We show that the alternation-free fragment of the modal μ-calculus and the bisimulation-invariant fragment of well-founded MSO have the same expressive power on trees of arbitrary branching degree. Free anysend cmi limited download software at UpdateStar - AnySend, a program designed to help users quickly transfer files from one PC to anther connected to the same network. In analogy with the result of Janin and Walukiewicz for MSO and the modal μ-calculus, this raises the issue of which modal logic captures the bisimulation-invariant fragment of well-founded MSO and weak MSO. ![]() ![]() Indeed, in this generalized setting, weak MSO gives an account of properties of the ‘horizontal dimension’ of trees, which cannot be described by means of MSO or well-founded MSO formulae. For Windows XP double-click on the Add or Remove Programs icon. We show that, on trees with arbitrary branching degree, weak MSO-automata characterize the expressive power of well-founded MSO, which turns out to be incomparable with weak MSO. La arquitectura del CMI se basa en el en-foque metodolgico que se expone en el grfico n 1. When in the Control Panel, double-click on one of the options below depending on your version of Windows. The associated class of automata (called weak MSO-automata) is a restriction of the class characterizing MSO-expressivity. On finitely branching trees, weak and well-founded MSO have the same expressive power and are both strictly weaker than MSO. In particular we are interested in weak MSO and well-founded MSO, where the second-order quantifiers range respectively over finite sets and over subsets of well-founded trees. ![]() "In this thesis we study the expressive power of variants of monadic second-order logic (MSO) on infinite trees by means of automata.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |