A Note on Decidable Separability by Piecewise Testable Languages (Q2947878): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Indexed Grammars—An Extension of Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding twig-definability of node selecting tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular tree languages definable in FO and in FO <sub> <i>mod</i> </sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra for Infinite Forests with an Application to the Temporal Logic EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise testable tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Vector Addition Systems with one zero-test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Separability of Regular Languages by Subsequences and Suffixes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parikh's theorem: a simple and direct automaton construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on undecidable properties of formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5738937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decidability of Grammar Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic decision procedures for local testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Regular Languages by Piecewise Testable and Unambiguous Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going Higher in the First-Order Quantifier Alternation Hierarchy on Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating regular languages with first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization forests of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups and languages of dot-depth two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncanonical Extensions of Bottom-Up Parsing Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Computing Downward Closures / rank
 
Normal rank

Latest revision as of 19:41, 10 July 2024

scientific article
Language Label Description Also known as
English
A Note on Decidable Separability by Piecewise Testable Languages
scientific article

    Statements

    A Note on Decidable Separability by Piecewise Testable Languages (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers