Generic results for concatenation hierarchies (Q2311891): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2770662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial operations and hierarchies of concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Height via Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations Defining the Polynomial Closure of a Lattice of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dot-depth of star-free events / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dot-depth hierarchy of star-free languages is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization forests for infinite words and applications to countable scattered linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a question of Eggan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of dot-depth 3/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation theorems on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance desert automata and the star height problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Studies. (AM-34) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Height of Factorization Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order logic and star-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explicit Formula for the Intersection of Two Polynomials of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems About Regular Languages, 35 Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Regular Languages with Two Quantifiers Alternations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating regular languages with two quantifier alternations / 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: Q2955031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Successor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation hierarchies: new bottle, old wine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / 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: A delay theorem for pointlikes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Schützenberger product of finite monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite semigroup varieties of the form V*D / 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: The Power of Diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying regular events in symbolic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the Ehrenfeucht-Fraisse game in formal language theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785956 / rank
 
Normal rank

Revision as of 18:51, 19 July 2024

scientific article
Language Label Description Also known as
English
Generic results for concatenation hierarchies
scientific article

    Statements

    Generic results for concatenation hierarchies (English)
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    concatenation hierarchies
    0 references
    regular languages
    0 references
    membership problem
    0 references
    separation problem
    0 references
    first-order logic
    0 references
    quantifier alternation
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references