Q5376657 (Q5376657): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise testable tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simon's theorem for scattered words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Piecewise Testable Separability for Regular Tree Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free monoids partially ordered by embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3618853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5738937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shuffle products, acyclic automata and piecewise-testable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recompression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. I: Finite semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel methods for learning languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the index of Simon's congruence for piecewise testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise testable languages via combinatorics on words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of closures and interiors of regular languages with subwords and superwords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative Automata Characterization of Piecewise Testable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5278312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Height of Piecewise-Testable Languages with Applications in Logical Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the Subword Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of orders on the set of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of k-Piecewise Testability and the Depth of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Boolean combinations forming piecewise testable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of word equations with constants is in PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cognitive and Sub-regular Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered finite monoids and a theorem of I. Simon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of reversals of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of finite monoids: the language approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Computing Downward Closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability by piecewise testable languages and downward closures beyond subwords / rank
 
Normal rank

Latest revision as of 07:46, 19 July 2024

scientific article; zbMATH DE number 7056230
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7056230

    Statements

    17 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    logic of subsequences
    0 references
    piecewise-testable languages
    0 references
    descriptive complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references