Alternative Automata Characterization of Piecewise Testable Languages
From MaRDI portal
Publication:5300848
DOI10.1007/978-3-642-38771-5_26zbMath1381.68123OpenAlexW2285315733MaRDI QIDQ5300848
Publication date: 28 June 2013
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_26
Related Items
On Boolean combinations forming piecewise testable languages ⋮ On the Complexity of k-Piecewise Testability and the Depth of Automata ⋮ Learning from positive and negative examples: dichotomies and parameterized algorithms ⋮ Obituary: Libor Polák (1950--2020) ⋮ Unnamed Item ⋮ On the Simon's congruence neighborhood of languages ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ On the index of Simon's congruence for piecewise testability ⋮ Unnamed Item
This page was built for publication: Alternative Automata Characterization of Piecewise Testable Languages
