Recursivite et cônes rationnels fermés par intersection (Q1133331): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Some decision problems related to the reachability problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une hiérarchie des parties rationnelles de N2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and szilard languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection-closed full AFL and the recursively enumerable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: What makes some language theory problems undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transductions des langages de Chomsky / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02576519 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086340783 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Recursivite et cônes rationnels fermés par intersection
scientific article

    Statements

    Recursivite et cônes rationnels fermés par intersection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1978
    0 references
    0 references
    abstract families of languages
    0 references
    quasi-commutative grammars
    0 references
    reachability problem in vector-addition systems
    0 references
    rational cones
    0 references
    semi-Dyck language
    0 references
    decidability
    0 references
    recursive languages
    0 references
    0 references