Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:episciences.org:lmcs:1216

Piecewise testable tree languages

Authors
Publication date
29 September 2012
Publisher
Doi

    Abstract

    This paper presents a decidable characterization of tree languages that canbe defined by a boolean combination of Sigma_1 sentences. This is a treeextension of the Simon theorem, which says that a string language can bedefined by a boolean combination of Sigma_1 sentences if and only if itssyntactic monoid is J-trivial

    Similar works

    Full text

    thumbnail-image

    Episciences.org

    redirect
    oaioai:episciences.org:lmcs:1216
    Last time updated on 02/12/2023

    This paper was published in Episciences.org.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.