State complexity of combined operations for suffix-free regular languages (Q392179): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2013.09.014 / rank
Normal rank
 
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.09.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068984365 / 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: Q4465331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505886 / 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: State complexity of basic operations on suffix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655366 / 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 CONCATENATION AND COMPLEMENTATION / 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: Reversal of binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941905 / 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: State complexity of combined operations / 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: ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692941 / 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 / DOI
 
Property / DOI: 10.1016/J.TCS.2013.09.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:15, 9 December 2024

scientific article
Language Label Description Also known as
English
State complexity of combined operations for suffix-free regular languages
scientific article

    Statements

    State complexity of combined operations for suffix-free regular languages (English)
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    state complexity
    0 references
    suffix-free regular languages
    0 references
    combined operations
    0 references

    Identifiers