Input-driven pushdown automata on well-nested infinite strings (Q2117102): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Victor L. Selivanov / rank
Normal rank
 
Property / author
 
Property / author: Victor L. Selivanov / 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.1007/978-3-030-79416-3_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3175969508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of deterministic context-free \(\omega\)-languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Complexity of Context-Free ω-Languages: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wadge-like reducibilities on arbitrary quasi-Polish spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input-Driven Pushdown Automata with Limited Nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional complexity of unambiguous input-driven pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of operations on input-driven pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ω-regular sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:05, 28 July 2024

scientific article
Language Label Description Also known as
English
Input-driven pushdown automata on well-nested infinite strings
scientific article

    Statements

    Identifiers