{"title":"oi层次结构的自动机理论表征","authors":"Werner Damm, Andreas Goerdt","doi":"10.1016/S0019-9958(86)80016-X","DOIUrl":null,"url":null,"abstract":"<div><p>This paper gives an automata-theoretical characterization of the OI-hierarchy (<span>Damm (1982)</span>, <span>Engelfriet and Schmidt (1977)</span>, <span>Wand (1975)</span>). This hierarchy is generated by so-called level-<em>n</em> grammars which are natural generalizations from context free and macro grammars in that their nonterminals are treated as functionals of higher type, i.e., they are allowed to carry up to <em>n</em> levels of parameters. The automata model used for this characterization is the <em>n</em>-iterated pushdown automaton. Its characteristic feature is the storage structure which consists of a nesting of pushdowns up to nesting depth <em>n</em>. The equivalence proof is given constructively, its method is illustrated using examples. By viewing level-<em>n</em> grammars as modeling recursive procedures on higher types the iterated pushdown automation thus provides an operational model for the run-time behavior of procedures defined by recursion on higher types which makes the results of this paper interesting not only from a language theoretical point of view.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80016-X","citationCount":"71","resultStr":"{\"title\":\"An automata-theoretical characterization of the OI-hierarchy\",\"authors\":\"Werner Damm, Andreas Goerdt\",\"doi\":\"10.1016/S0019-9958(86)80016-X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper gives an automata-theoretical characterization of the OI-hierarchy (<span>Damm (1982)</span>, <span>Engelfriet and Schmidt (1977)</span>, <span>Wand (1975)</span>). This hierarchy is generated by so-called level-<em>n</em> grammars which are natural generalizations from context free and macro grammars in that their nonterminals are treated as functionals of higher type, i.e., they are allowed to carry up to <em>n</em> levels of parameters. The automata model used for this characterization is the <em>n</em>-iterated pushdown automaton. Its characteristic feature is the storage structure which consists of a nesting of pushdowns up to nesting depth <em>n</em>. The equivalence proof is given constructively, its method is illustrated using examples. By viewing level-<em>n</em> grammars as modeling recursive procedures on higher types the iterated pushdown automation thus provides an operational model for the run-time behavior of procedures defined by recursion on higher types which makes the results of this paper interesting not only from a language theoretical point of view.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80016-X\",\"citationCount\":\"71\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S001999588680016X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S001999588680016X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
An automata-theoretical characterization of the OI-hierarchy
This paper gives an automata-theoretical characterization of the OI-hierarchy (Damm (1982), Engelfriet and Schmidt (1977), Wand (1975)). This hierarchy is generated by so-called level-n grammars which are natural generalizations from context free and macro grammars in that their nonterminals are treated as functionals of higher type, i.e., they are allowed to carry up to n levels of parameters. The automata model used for this characterization is the n-iterated pushdown automaton. Its characteristic feature is the storage structure which consists of a nesting of pushdowns up to nesting depth n. The equivalence proof is given constructively, its method is illustrated using examples. By viewing level-n grammars as modeling recursive procedures on higher types the iterated pushdown automation thus provides an operational model for the run-time behavior of procedures defined by recursion on higher types which makes the results of this paper interesting not only from a language theoretical point of view.