The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q19 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6065027 / rank
 
Normal rank
Property / zbMATH Keywords
 
finite state automata
Property / zbMATH Keywords: finite state automata / rank
 
Normal rank
Property / zbMATH Keywords
 
regular languages
Property / zbMATH Keywords: regular languages / rank
 
Normal rank
Property / zbMATH Keywords
 
pushdown automata
Property / zbMATH Keywords: pushdown automata / 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.2012.05.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177633274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More concise representation of regular languages by automata and regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / 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: Complexity measures for regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language operations with regular expressions of polynomial size / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean closure of linear context-free languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:51, 5 July 2024

scientific article
Language Label Description Also known as
English
The size-cost of Boolean operations on constant height deterministic pushdown automata
scientific article

    Statements

    The size-cost of Boolean operations on constant height deterministic pushdown automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    finite state automata
    0 references
    regular languages
    0 references
    pushdown automata
    0 references

    Identifiers