oi层次结构的自动机理论表征

Q4 Mathematics 信息与控制 Pub Date : 1986-10-01 DOI:10.1016/S0019-9958(86)80016-X
Werner Damm, Andreas Goerdt
{"title":"oi层次结构的自动机理论表征","authors":"Werner Damm,&nbsp;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":"71 1","pages":"Pages 1-32"},"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,&nbsp;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\":\"71 1\",\"pages\":\"Pages 1-32\"},\"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}
引用次数: 71

摘要

本文给出了oi层次的自动机理论表征(Damm (1982), Engelfriet和Schmidt (1977), Wand(1975))。这种层次结构是由所谓的n级语法生成的,它是上下文无关语法和宏语法的自然概括,因为它们的非终结符被视为更高类型的函数,也就是说,它们被允许携带多达n个参数。用于此表征的自动机模型是n次迭代下推自动机。它的特征是存储结构是由一组深度为n的下推嵌套组成的。构造性地给出了等价证明,并用实例说明了它的方法。通过将n级语法看作是对高级类型递归过程的建模,迭代下推自动化为由高级类型递归定义的过程的运行时行为提供了一个操作模型,这使得本文的结果不仅从语言理论的角度来看是有趣的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
期刊最新文献
Systolic trellis automata: Stability, decidability and complexity On relativized exponential and probabilistic complexity classes A note on succinct representations of graphs Function definitions in term rewriting and applicative programming Simulation of large networks on smaller networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1