Incomplete operational transition complexity of regular languages (Q498392): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: UMDES / 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.ic.2015.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1161730093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and generation with a string automata representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of finite automata accepting subregular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity in Convex Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition complexity of language operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition Complexity of Incomplete DFAs / 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: Q4418610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and Computational Complexity of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: Incomplete Transition Complexity of Basic Operations on Finite Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Transition Complexity of Some Basic Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3571953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular-expression derivatives re-examined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional Complexity of Nondeterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Combined Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity Research and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:30, 10 July 2024

scientific article
Language Label Description Also known as
English
Incomplete operational transition complexity of regular languages
scientific article

    Statements

    Incomplete operational transition complexity of regular languages (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2015
    0 references
    0 references
    descriptional complexity
    0 references
    automata theory
    0 references
    regular languages
    0 references
    transition complexity
    0 references
    state complexity
    0 references
    0 references