Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.09.035 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MoCHi / 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.2018.09.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2909807115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The IO- and OI-hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Higher-Order Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types and higher-order recursion schemes for verification of higher-order programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying higher-order functional programs with pattern-matching algebraic data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superdeterministic PDAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results on Balanced Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The IO and OI hierarchies revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On word and frontier languages of unsafe higher-order grammars / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.09.035 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 18 December 2024

scientific article
Language Label Description Also known as
English
Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
scientific article

    Statements

    Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (English)
    0 references
    0 references
    18 June 2019
    0 references
    recursive program schemes
    0 references
    higher-order languages
    0 references
    Dyck language
    0 references
    Diophantine equations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references