Language operations with regular expressions of polynomial size (Q2271463): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM / rank
 
Normal rank
Property / cites work
 
Property / cites work: From regular expressions to deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local languages and the Berry-Sethi algorithm / 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: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical derivatives, partial derivatives and finite automaton constructions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: General properties of star height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Lower Bounds for Nondeterministic State Complexity Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the Size of Higman-Haines Sets: Effective Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Follow automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Scattered Substrings and Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of cyclic shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expression for a language without empty word / rank
 
Normal rank

Latest revision as of 21:25, 1 July 2024

scientific article
Language Label Description Also known as
English
Language operations with regular expressions of polynomial size
scientific article

    Statements

    Language operations with regular expressions of polynomial size (English)
    0 references
    0 references
    0 references
    7 August 2009
    0 references
    0 references
    regular expressions
    0 references
    derivatives
    0 references
    language quotient
    0 references
    cyclic shift
    0 references
    circular shift
    0 references
    0 references
    0 references