License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2015.503
URN: urn:nbn:de:0030-drops-56303
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5630/
Go to the corresponding LIPIcs Volume Portal

Weidner, Thomas

Probabilistic Regular Expressions and MSO Logic on Finite Trees

pdf-format:
15.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{weidner:LIPIcs:2015:5630,
  author =	{Thomas Weidner},
  title =	{{ Probabilistic Regular Expressions and MSO Logic on Finite Trees}},
  booktitle =	{35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
  pages =	{503--516},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-97-2},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{45},
  editor =	{Prahladh Harsha and G. Ramalingam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5630},
  URN =		{urn:nbn:de:0030-drops-56303},
  doi =		{10.4230/LIPIcs.FSTTCS.2015.503},
  annote =	{Keywords: Probabilistic Regular Expressions, MSO Logic, Tree Automata}
}

Keywords: Probabilistic Regular Expressions, MSO Logic, Tree Automata
Collection: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Issue Date: 2015
Date of publication: 14.12.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI