Mikołaj Bojańczyk

July 14, 2015

Mikołaj Bojańczyk, Tomasz Idziaszek

*Algebra for Infinite Forests with an Application to the Temporal Logic EF.*CONCUR, 2009 PDFMikołaj Bojańczyk, Thomas Place

*Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets.*ICALP (2), 2012 PDFMikołaj Bojańczyk, Tomasz Idziaszek, Michal Skrzypczak

*Regular languages of thin trees.*STACS, 2013 PDF

There are algebras for finite words (monoids or semigroups), infinite words (e.g. ω-semigroups or Wilke semigroups) and finite trees (e.g. clones or forest algebras). What about infinite trees? In [1] we propose a notion of algebra for infinite trees, which is an extension of forest algebra. It is not completely satisfactory (there is no result that finite algebras can be represented in a finite way), but it is good enough to characterize some logics, e.g. the temporal logic EF. The paper [2] continues the study of algebras for infinite trees, by giving a structural characterization of some random logic (namely, Boolean combinations of sets that are open in the Borel topology). The idea is to learn what kind of structural theory of regular tree languages is needed to do nontrivial characterizations. Finally, the last paper [3] shows that most of the technical problems go away when considering thin trees, which are infinite trees with countably many branches.

COMMENTS

Jeanne

May 10, 2017

hypixel coin generator

Cordelia

May 8, 2017

http://autofinanzierungcom.pw/gebrauchtwagen-finanzierung.html

Namari

April 20, 2017

fifa ultimate

Mellie

April 10, 2017

low income car insurance dmv League City TX

Marnie

March 31, 2017

privatkredit vergleich

Mildred

March 7, 2017

http://www.takebuseleven.com/insurance-dallas.html

Lilly

February 22, 2017

http://onsetwithjaslene.com/what-do-you-need-to-insure-a-car-in-ny.html