On the active and full use of memory in right-boundary grammars and push- down automata (Q1099637): 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/0304-3975(86)90095-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999910908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular canonical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every two equivalent DOL systems have a regular true envelope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated pair systems ; part I : Dyck works and classical pumping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the active and full use of memory in right-boundary grammars and push- down automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coordinated selective substitutions: Towards a unified theory of grammars and machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank

Latest revision as of 15:18, 18 June 2024

scientific article
Language Label Description Also known as
English
On the active and full use of memory in right-boundary grammars and push- down automata
scientific article

    Statements

    On the active and full use of memory in right-boundary grammars and push- down automata (English)
    0 references
    1986
    0 references
    coordinated pair system
    0 references
    right-boundary grammar
    0 references
    pair of rewritings
    0 references
    push-down automata
    0 references
    0 references
    0 references
    0 references

    Identifiers