Two double-exponential gaps for automata with a limited pushdown (Q515677): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2016.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2414151754 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q115574502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On context-free languages and push-down automata / 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: 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: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean closure of linear context-free 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: The size-cost of Boolean operations on constant height deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Nondeterminism in Constant Height Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue Automata of Constant Length / rank
 
Normal rank

Latest revision as of 13:11, 13 July 2024

scientific article
Language Label Description Also known as
English
Two double-exponential gaps for automata with a limited pushdown
scientific article

    Statements

    Two double-exponential gaps for automata with a limited pushdown (English)
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    pushdown automata
    0 references
    finite state automata
    0 references
    two-way automata
    0 references
    regular languages
    0 references
    descriptional complexity
    0 references

    Identifiers