Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237): 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.1016/j.jcss.2017.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W32399579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Double-Exponential Gaps for Automata with a Limited Pushdown / 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: Removing nondeterminism in constant height pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Promise Problems on Classical and Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2882386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behaviours of Unary Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syllabic Languages and Go-through Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures for regular expressions / 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: Two-way unary automata versus logarithmic space / 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: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue Automata of Constant Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size complexity of rotating and sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic input-driven queue automata: finite turns, decidability, and closure properties / 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: Descriptional complexity of two-way pushdown automata with restricted head reversals / 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: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:30, 14 July 2024

scientific article
Language Label Description Also known as
English
Boolean language operations on nondeterministic automata with a pushdown of constant height
scientific article

    Statements

    Boolean language operations on nondeterministic automata with a pushdown of constant height (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 September 2017
    0 references
    descriptional complexity
    0 references
    finite state automata
    0 references
    regular languages
    0 references
    nondeterministic pushdown automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers