全文获取类型
收费全文 | 81篇 |
免费 | 1篇 |
国内免费 | 3篇 |
专业分类
化学 | 1篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 76篇 |
物理学 | 5篇 |
出版年
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2017年 | 4篇 |
2015年 | 1篇 |
2014年 | 1篇 |
2013年 | 5篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 6篇 |
2008年 | 2篇 |
2007年 | 10篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有85条查询结果,搜索用时 402 毫秒
1.
C. -H. L. Ong 《Annals of Pure and Applied Logic》2004,130(1-3):125-171
We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function fM. Given any such fM, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable. 相似文献
2.
Gerhard Lischke 《Mathematical Logic Quarterly》2006,52(1):20-28
Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
3.
Johan van Benthem 《Logica Universalis》2007,1(1):125-138
We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order
logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference
between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections
with interpolation properties, and the modal invariance theorem.
Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95 相似文献
4.
Martin Kutrib 《Discrete Applied Mathematics》2007,155(16):2152-2164
Turn bounded pushdown automata with different conditions for beginning a new turn are investigated. Their relationships with closures of the linear context-free languages under regular operations are studied. For example, automata with an unbounded number of turns that have to empty their pushdown store up to the initial symbol in order to start a new turn are characterized by the regular closure of the linear languages. Automata that additionally have to re-enter the initial state are (almost) characterized by the Kleene star closure of the linear languages. For both a bounded and an unbounded number of turns, requiring to empty the pushdown store is a strictly stronger condition than requiring to re-enter the initial state. Several new language families are obtained which form a double-stranded hierarchy. Closure properties of these families under AFL operations are derived. The regular closure of the linear languages share the strong closure properties of the context-free languages, i.e., the family is a full AFL. Interestingly, three natural new language families are not closed under intersection with regular languages and inverse homomorphism. Finally, an algorithm is presented parsing languages from the new families in quadratic time. 相似文献
5.
The class of quantum languages Q() over an alphabet is the class of languages accepted by quantum automata. We study properties of Q() and compare Q() with the class of regular languages R(). It is shown that Q() is closed under union, intersection, and reversal but is not closed under complementation, concatenation, or Kleene star. It is also shown that Q() and R() are incomparable. Finally, we prove that L Q() if and only if L admits a transition amplitude function satisfying a certain property and a similar characterization is given for R(). 相似文献
6.
In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars. 相似文献
7.
Gautam Mitra Cormac Lucas Shirley Moody Bjarni Kristjansson 《Computational Optimization and Applications》1995,4(3):263-283
LP models are usually constructed using index sets and data tables which are closely related to the attributes and relations of relational database (RDB) systems. We extend the syntax of MPL, an existing LP modelling language, in order to connect it to a given RDB system. This approach reuses existing modelling and database software, provides a rich modelling environment and achieves model and data independence. This integrated software enables Mathematical Programming to be widely used as a decision support tool by unlocking the data residing in corporate databases. 相似文献
8.
Fuzzy ontology representation using OWL 2 总被引:3,自引:0,他引:3
Fernando Bobillo Umberto Straccia 《International Journal of Approximate Reasoning》2011,52(7):1073-1094
The need to deal with vague information in Semantic Web languages is rising in importance and, thus, calls for a standard way to represent such information. We may address this issue by either extending current Semantic Web languages to cope with vagueness, or by providing a procedure to represent such information within current standard languages and tools. In this work, we follow the latter approach, by identifying the syntactic differences that a fuzzy ontology language has to cope with, and by proposing a concrete methodology to represent fuzzy ontologies using OWL 2 annotation properties. We also report on some prototypical implementations: a plug-in to edit fuzzy ontologies using OWL 2 annotations and some parsers that translate fuzzy ontologies represented using our methodology into the languages supported by some reasoners. 相似文献
9.
Gerhard Lischke 《Mathematical Logic Quarterly》2005,51(3):299-304
The square of a language L is the set of all words pp where p ∈ L. The square of a regular language may be regular too or context‐free or none of both. We give characterizations for each of these cases and show that it is decidable whether a regular language has one of these properties. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
10.