State complexity of basic operations on suffix-free regular languages (Q1029324): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.12.054 / 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.2008.12.054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109036808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Regular Expressions and Their Applications / 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: STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284228 / 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: 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: On the state complexity of reversals of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / 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.2008.12.054 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 10 December 2024

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

    Statements

    Identifiers