Nondeterministic complexity in subclasses of convex languages (Q2319915): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4465337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4590910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of cyclic shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient complexity of ideal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient complexity of closed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity in Convex Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of proper prefix-convex regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY IN UNION-FREE REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of some operations on binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic state complexity of star-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders on words, minimal elements of regular languages, and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic complexity of operations on free and convex languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Complexity of Operations on Closed and Ideal Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On NFAs where all states are final, initial, or both / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary finite automata vs. arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement on Free and Ideal 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: Determination of finite automata accepting subregular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27--30, 2017. Proceedings / rank
 
Normal rank

Revision as of 06:29, 20 July 2024

scientific article
Language Label Description Also known as
English
Nondeterministic complexity in subclasses of convex languages
scientific article

    Statements

    Nondeterministic complexity in subclasses of convex languages (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    0 references
    nondeterministic finite automata
    0 references
    descriptional complexity
    0 references
    intersection
    0 references
    union
    0 references
    concatenation
    0 references
    Kleene star
    0 references
    reversal
    0 references
    complementation
    0 references
    convex languages
    0 references
    free languages
    0 references
    ideal languages
    0 references
    closed languages
    0 references
    operational state 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