IWIM Semantics via Fibred Automata
- 作者R. Banach; F. Arbab; G.A. Papadopoulos; J.R.W. Glauert
- 卷第66卷
- 期第4期
- 印刷ISSN1571-0661
- 文件大小663.05KB
- 发表时间2002
- DOI10.1016/s1571-0661(04)80446-8
- 页码1-15
同作者推荐
Density and Baire category in recursive topologyIraj Kalantari; Larry Welch · 2004
On Turing degrees of points in computable topologyIraj Kalantari; Larry Welch · 2008
A blend of methods of recursion theory and topologyIraj Kalantari; Larry Welch · 2003
On degree-preserving homeomorphisms between trees in computable topologyIraj Kalantari; Larry Welch · 2008
When series of computable functions with varying domains are computableKalantari, Iraj; Welch, Larry · Mathematical Logic Quarterly · 2013
A blend of methods of recursion theory and topology: AIraj Kalantari; Larry Welch · Archive for Mathematical Logic · 2004