State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4778601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540955 / 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: Q2731279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of reversals of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Basic Operations on Suffix-Free Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of combined operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexity of \(L^{2}\) and \(L^k\) / rank
 
Normal rank

Latest revision as of 11:15, 1 July 2024

scientific article
Language Label Description Also known as
English
State Complexity of Combined Operations for Prefix-Free Regular Languages
scientific article

    Statements

    State Complexity of Combined Operations for Prefix-Free Regular Languages (English)
    0 references
    0 references
    0 references
    0 references
    2 April 2009
    0 references
    0 references
    0 references