Probabilistic Regular Expressions and MSO Logic on Finite Trees
نویسنده
چکیده
We introduce probabilistic regular tree expressions and give a Kleene-like theorem for probabilistic tree automata (PTA). Furthermore, we define probabilistic MSO logic. This logic is more expressive than PTA. We define bottom-up PTA, which are strictly more expressive than PTA. Using bottom-up PTA, we prove a Büchi-like theorem for probabilistic MSO logic. We obtain a Nivat-style theorem as an additional result. 1998 ACM Subject Classification F.1.1 Models of Computation, G.3 Probability and Statictics
منابع مشابه
Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions
Monadic second-order logic on finite words (MSO) is a decidable yet expressive logic into which many decision problems can be encoded. Since MSO formulas correspond to regular languages, equivalence of MSO formulas can be reduced to the equivalence of some regular structures (e.g. automata). We verify an executable decision procedure for MSO formulas that is not based on automata but on regular...
متن کاملVerified Decision Procedures for MSO on Words
Monadic second-order logic on finite words (MSO) is a decidable yet expressive logic into which many decision problems can be encoded. Since MSO formulas correspond to regular languages, equivalence of MSO formulas can be reduced to the equivalence of some regular structures (e.g. automata). This paper presents a verified functional decision procedure for MSO formulas that is not based on autom...
متن کاملOn Expressive Power of Regular Expressions over Infinite Orders
Two fundamental results of classical automata theory are the Kleene theorem and the Büchi-Elgot-Trakhtenbrot theorem. Kleene’s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. Büchi-ElgotTrakhtenbrot’s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in th...
متن کاملA Counting Logic for Structure Transition Systems
Quantitative questions such as “what is the maximum number of tokens in a place of a Petri net?” or “what is the maximal reachable height of the stack of a pushdown automaton?” play a significant role in understanding models of computation. To study such problems in a systematic way, we introduce structure transition systems on which one can define logics that mix temporal expressions (e.g. rea...
متن کاملExpressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree
In this thesis we study the expressive power of variants of monadic second-order logic (MSO) on infinite trees by means of automata. 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. On finitely branching trees, weak and well-founded MSO have the same expressive power a...
متن کامل