The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper (Q1227278): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/0020-0190(74)90050-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992222837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur diverses familles de langages fermées par transduction rationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer programming and formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chains of full AFL's / rank
 
Normal rank
Property / cites work
 
Property / cites work: A helpful result for proving inherent ambiguity / rank
 
Normal rank

Latest revision as of 18:00, 12 June 2024

scientific article
Language Label Description Also known as
English
The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper
scientific article

    Statements

    The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper (English)
    0 references
    1973
    0 references
    0 references

    Identifiers