State complexity of star of union and square of union on \textit{k} regular languages (Q391180): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2166846151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of combined operations with two basic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2819380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of state complexity of combined operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of union and intersection of star on \(k\) regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5146522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION / 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: On the State Complexity of Star of Union and Star of Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of basic language operations combined with reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / 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: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexity of \(L^{2}\) and \(L^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of combined operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the State Complexity of Composed Regular Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / 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: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Combined Operations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:45, 7 July 2024

scientific article
Language Label Description Also known as
English
State complexity of star of union and square of union on \textit{k} regular languages
scientific article

    Statements

    State complexity of star of union and square of union on \textit{k} regular languages (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    state complexity
    0 references
    combined operations
    0 references
    regular languages
    0 references
    finite automata
    0 references

    Identifiers