On shuffle products, acyclic automata and piecewise-testable languages (Q1730033): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1810.02953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of R-trivial monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of finiteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893297 / 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: Modeling literal morphisms by shuffle / 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: Q5144688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shuffle Ideals / 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: On biautomata / 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: Q4608630 / 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: Q3960138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems from the theory of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of finite monoids: the language approach / rank
 
Normal rank

Latest revision as of 16:24, 18 July 2024

scientific article
Language Label Description Also known as
English
On shuffle products, acyclic automata and piecewise-testable languages
scientific article

    Statements

    On shuffle products, acyclic automata and piecewise-testable languages (English)
    0 references
    11 March 2019
    0 references
    0 references
    formal languages
    0 references
    piecewise-testable languages
    0 references
    subwords
    0 references
    subsequences
    0 references
    dot-depth-one languages
    0 references
    star-free languages
    0 references
    shuffle product
    0 references
    0 references
    0 references
    0 references
    0 references