All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 15 Next

Displaying 281 – 300 of 2186

Showing per page

Applying A Normalized Compression Metric To The Measurement Of Dialect Distance

Simov, Kiril, Osenova, Petya (2007)

Serdica Journal of Computing

The paper discusses the application of a similarity metric based on compression to the measurement of the distance among Bulgarian dia- lects. The similarity metric is de ned on the basis of the notion of Kolmo- gorov complexity of a le (or binary string). The application of Kolmogorov complexity in practice is not possible because its calculation over a le is an undecidable problem. Thus, the actual similarity metric is based on a real life compressor which only approximates the Kolmogorov complexity....

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Choe, Changil, O., Hyong-Chol, Han, Song (2013)

Serdica Journal of Computing

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented....

Arbology: Trees and pushdown automata

Bořivoj Melichar, Jan Janoušek, Tomas Flouri (2012)

Kybernetika

We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...

Asymptotic analysis of a class of functional equations and applications

P. J. Grabner, H. Prodinger, R. F. Tichy (1993)

Journal de théorie des nombres de Bordeaux

Flajolet and Richmond have invented a method to solve a large class of divide-and-conquer recursions. The essential part of it is the asymptotic analysis of a certain generating function for z → ∞ by means of the Mellin transform. In this paper this type of analysis is performed for a reasonably large class of generating functions fulfilling a functional equation with polynomial coefficients. As an application, the average life time of a party of N people is computed, where each person advances one...

Asymptotic behaviour of bi-infinite words

Wit Foryś (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.

Asymptotic behaviour of bi-infinite words

Wit Foryś (2010)

RAIRO - Theoretical Informatics and Applications

We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.

Currently displaying 281 – 300 of 2186