Concatenation of regular languages and descriptional complexity (Q639851): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1007/s00224-011-9318-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972592804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders on words, minimal elements of regular languages, and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic numbers in the state hierarchy of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of NFAs which need 2\(^{n}-\alpha\) deterministic states / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779161 / 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 Operations on Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Numbers and Ternary Alphabet / 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: 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: On the state complexity of reversals of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681320 / 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: MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:08, 4 July 2024

scientific article
Language Label Description Also known as
English
Concatenation of regular languages and descriptional complexity
scientific article

    Statements

    Concatenation of regular languages and descriptional complexity (English)
    0 references
    0 references
    11 October 2011
    0 references
    regular languages
    0 references
    concatenation
    0 references
    state complexity
    0 references

    Identifiers