The complexity of concatenation on deterministic and alternating finite automata (Q5223613): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128539404, #quickstatements; #temporary_batch_1723902436788
 
(4 intermediate revisions by 4 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.1051/ita/2018011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2913798541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for alternating finite automata<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: Descriptional Complexity of Operations on Alternating and Boolean Automata / 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: On generalized language equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128539404 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:23, 17 August 2024

scientific article; zbMATH DE number 7082325
Language Label Description Also known as
English
The complexity of concatenation on deterministic and alternating finite automata
scientific article; zbMATH DE number 7082325

    Statements

    The complexity of concatenation on deterministic and alternating finite automata (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2019
    0 references
    0 references
    regular languages
    0 references
    finite automata
    0 references
    concatenation
    0 references
    state complexity
    0 references
    0 references
    0 references