Complexity of universality and related problems for partially ordered NFAs (Q2013561): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2519230465 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.03460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decidability of Intermediate Levels of Concatenation Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying Regular Graph Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation rewriting and algorithmic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-unambiguous regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of R-trivial monoids / 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: Dot-depth of star-free events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Definability by Deterministic Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of dot-depth 3/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5738937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Parallels between the Regular and Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / 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: Q4608624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Around Dot Depth Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions / 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: Separating Regular Languages with Two Quantifiers Alternations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2955031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le produit de concatenation non ambigu / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic pushdown automata is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / 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: Machines, Computations, and Universality / rank
 
Normal rank

Latest revision as of 05:16, 14 July 2024

scientific article
Language Label Description Also known as
English
Complexity of universality and related problems for partially ordered NFAs
scientific article

    Statements

    Complexity of universality and related problems for partially ordered NFAs (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2017
    0 references
    automata
    0 references
    nondeterminism
    0 references
    partial order
    0 references
    universality
    0 references
    inclusion
    0 references
    equivalence
    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