The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
and computational complexity of infinite words. ... Summary: “This paper searches for connections between descrip- tional and computational complexities of infinite words. ...
The au- thors compare the complexities of descriptions of context-free languages by context-free grammars and various types of cooper- ating/distributed grammar systems. ... A generalization for the case of two-way infinite words is not so straightforward, as it is for the case of one-way infinite words (w- words). ...
The purpose of this project is to compare the complexities of different species' mitochondrial genome sequences. ... The complexity of each sequence is estimated as a ratio of the original sequence length to the length of the compressed sequence. ... MATHEMATICAL DESCRIPTION AND SOLUTION APPROACH We are interested in comparing complexities of mitochondrial genome sequences of different species. ...doi:10.5038/2326-3618.104.22.168 fatcat:ioj7hp243rc6bd5pfq3iobmhli
infinite words. ... The paper Level two of the quantifier alternation hierarchy over infinite words by Manfred Kufleitner and Tobias Walter addresses the membership problem for a certain fragment of first-order logic over ... The paper Comparing representations for function spaces in computable analysis by Arno Pauly and Florian Steinberg compares various representations of certain function spaces in the context of computable ...doi:10.1007/s00224-018-9854-5 fatcat:sbiokecipfaqldekzhdviifzx4
We study the computational power of these new acceptance mechanisms and prove some results on the descriptional complexity of conversions between automata with these new acceptance criteria and finite ... Formally, these conditions can be seen as the natural analogies of the Büchi and Muller acceptance for finite automata on infinite words. ... same language and vice versa. ...doi:10.1016/j.tcs.2004.06.030 fatcat:z5d3lw32bza2hla4uojuyfykvm
Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. ... We conjecture that for similar complexity measures that assign low complexity values, decidability imposes comparable limits to the stable growth of complexity, and that such behaviour is necessary for ... Acknowledgements We would like to thank Carlos Gershenson García for his comments during the development of this project and to acknowledge support from grants CB-2013-01/221341 and PAPIIT IN113013. ...arXiv:1606.01810v4 fatcat:budcsfjnk5cbfos4f4iwcr2nqu
Lecture Notes in Computer Science
In this paper, we will briefly review these approaches, and then show how weighted automata working on infinite trees can be used to construct computable concept comparison measures for FL0 that are equivalence ... Recently introduced approaches for relaxed query answering, approximately defining concepts, and approximately solving unification problems in Description Logics have in common that they are based on the ... Description Logics In Description Logics, concept constructors are used to build complex concept descriptions out of concept names (unary predicates) and role names (binary predicates). ...doi:10.1007/978-3-319-53733-7_1 fatcat:xfgqml73hbdo7gqtxrjcxvo3hy
In the first Part, I argued that both philosophy and technique of the perturbative renormalization in quantum field theory could be meaningfully transplanted to the theory of computation, and sketched ... In this second part, I address some of the issues raised in [Ma3] and provide their development in three contexts: a categorification of the algorithmic computations; time cut-off and Anytime Algorithms ... Finally, a remark on terminology: we use the word program as a synonym of "description of a method to compute a given function". ...doi:10.1017/s0960129511000508 fatcat:yzal3czu3rbt5oyrhfdwxijqla
In the first Part, I argued that both philosophy and technique of the perturbative renormalization in quantum field theory could be meaningfully transplanted to the theory of computation, and sketched ... In this second part, I address some of the issues raised in [Ma3] and provide their development in three contexts: a categorification of the algorithmic computations; time cut--off and Anytime Algorithms ... Finally, a remark on terminology: we use the word program as a synonym of "description of a method to compute a given function". ...arXiv:0908.3430v1 fatcat:uwiavgtjmzaypenj5gfphifruy
It is known that the é-complexity of this problem is infinite in the worst case setting. ... Rani Siromoney (6-MDRCC) 92h:68046 68Q45 03B45 03B70 03D05 Cohen-Chesnot, Joélle (F-CNRS-L) On the expressive power of temporal logic for infinite words. Theoret. Comput. ...
Questions on the economics of description size were already investigated in the early days of theoretical computer science and build a cornerstone of descriptional complexity theory [39, 49, 58] . ... one descriptional system compared to an equivalent description of another descriptional system. ... So, we can semi-decide infiniteness by first computing n and then verifying for all words longer than n whether they belong to L. ...doi:10.1016/j.tcs.2010.08.024 fatcat:yjkjor7r5rawrjijnxihcdnuve
(D-DORT-I2; Dortmund) Codes and infinite words. (English and French summaries) Acta Cybernet. 11 (1994), no. 4, 241-256. Summary: “Codes can be characterized by their way of acting on infinite words. ... The third characteristic fact is the finiteness of the number of fac- torizations of the rational infinite words. ...
This analysis bring us to demonstrate that the basic assumptions affect in different ways:(a) the general problem of the information and computability about a system, (b) the nature of the math tool utilized ... Starting from philosophical conjectures (Platonism, Idealism and Realism) as basic ontic elements (namely: math world, data world, and state of matter), we will analyze the quantum superposition principle ... A summary of the positions regarding c 1 and c 2 : Assumptions: c 1 and c 2 ψ = c 1 ϕ 1 + c 2 ϕ 2 Platonism infinite information (comput.) all infinite and idealized reality is everywhere Idealism finite ...arXiv:quant-ph/0610228v1 fatcat:jx7az55hv5g5jbokp4otanirau
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. ... We develop a qualitative classification of non-recursive trade-offs in order to obtain a better understanding of this very fundamental behaviour of descriptional systems. ... context-sensitive grammars and ET0L systems, (VII) between context-sensitive grammars and (linear) context-free grammars, and (VIII) between context-sensitive grammars and indexed grammars. ...doi:10.4204/eptcs.3.13 fatcat:iwyn6aly6zbslj2qxx6kzf2u4m
Our approach performs joint segmentation and labeling of the noun phrases to link them to attributes of entities within the problem-solving environment. ... This paper presents a novel approach to semantic grounding of noun phrases within tutorial dialogue for computer programming. ... Any opinions, findings, conclusions, or recommendations expressed in this report are those of the authors, and do not necessarily represent the official views, opinions, or policy of the National Science ...doi:10.3115/v1/n15-1085 dblp:conf/naacl/LiB15 fatcat:saf3fbf6rndmxg6t25lnt43pl4
« Previous Showing results 1 — 15 out of 179,595 results