Number of the records: 1  

Partially ordered automata and piecewise testability

  1. 1.
    SYSNO ASEP0542403
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitlePartially ordered automata and piecewise testability
    Author(s) Masopust, Tomáš (MU-W) RID, ORCID, SAI
    Krötzsch, M. (DE)
    Article number14
    Source TitleLogical Methods in Computer Science. - : Logical Methods in Computer Science - ISSN 1860-5974
    Roč. 17, č. 2 (2021)
    Number of pages36 s.
    Languageeng - English
    CountryDE - Germany
    Keywordsautomata ; nondeterminism ; complexity
    Subject RIVBA - General Mathematics
    OECD categoryAutomation and control systems
    R&D ProjectsGC19-06175J GA ČR - Czech Science Foundation (CSF)
    Method of publishingOpen access
    Institutional supportMU-W - RVO:67985840
    UT WOS000658731000014
    EID SCOPUS85108388804
    DOI10.23638/LMCS-17(2:14)2021
    AnnotationPartially ordered automata are automata where the transition relation induces a partial order on states. The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on finite words or, equivalently, to the language classes of the levels of the Straubing-Thérien hierarchy. Several fragments (levels) have been intensively investigated under various names. For instance, the fragment of first-order formulae with a single existential block of quantifiers in prenex normal form is known as piecewise testable languages or J-trivial languages. These languages are characterized by confluent partially ordered DFAs or by complete, confluent, and self-loop-deterministic partially ordered NFAs (ptNFAs for short). In this paper, we study the complexity of basic questions for several types of partially ordered automata on finite words, namely, the questions of inclusion, equivalence, and (k-)piecewise testability.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2022
    Electronic addresshttps://dx.doi.org/10.23638/LMCS-17(2:14)2021
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.