| |
1-7 of 7 reviews |
Date Reviewed | |
| |
On computing the Hamming distance
Kéri G., Kisvölcsey Á. Acta Cybernetica 16(3): 443-449, 2004. Type: Article
The Hamming distance between two n-tuples is the number of positions in which they differ. Computing the Hamming distance for a large number of pairs of words is a hard problem. It is important in coding theory since...
|
Jul 20 2005 |
|
| |
Notes on the properties of dynamic programming used in direct load control
Aho I. Acta Cybernetica 16(3): 427-441, 2004. Type: Article
Direct load control is a method for managing consumer electricity demand during peak times, by interrupting power supply or starting generators to meet demand. Previous work on this problem used a dynamic programming solution with two ...
|
Dec 2 2004 |
|
| |
Programming by steps
Scarlatescu R. Acta Cybernetica 16(2): 293-314, 2003. Type: Article
A methodology based on recording a logical flow of steps associated with library functions is described in this paper. In this way, a main program can be made independent from step content by basing logical flow on param...
|
Mar 31 2004 |
|
| |
A distributed program synthesizer
Kotkas V. Acta Cybernetica 15(4): 567-581, 2002. Type: Article
This paper provides an overview of a distributed system for automatic program generation from specifications. The system is written in and for the Java programming language, but many of the ideas should be applicable to most object-ori...
|
Nov 10 2003 |
|
| |
On isomorphic representations of generalized definite automata
Gécseg F., Imreh B. Acta Cybernetica 15(1): 33-44, 2001. Type: Article
Definite events and languages were widely studied in the early days of automata theory. In 1966, Abraham Ginzburg introduced the very large class of generalized definite languages and automata. This paper addresses isomorphic represen...
|
Jan 21 2003 |
|
| |
A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages
Dömösi P., Okawa S. Acta Cybernetica 15(1): 25-32, 2001. Type: Article
In the early sixties, Chomsky and Schützenberger provided an important characterization of context-free languages. In its stronger form, due to Stanley, their theorem states that, for any alphabet A, there ...
|
Dec 18 2002 |
|
| |
Languages recognized by a class of finite automata
Kelarev A., Sokratova O. Acta Cybernetica 15(1): 45-52, 2001. Type: Article
Graph algebras in the sense of Oates-Williams make it possible to apply methods of universal algebra to various problems of theoretical computer science....
|
Dec 18 2002 |
|
| |
|
|
| |
|
|
|
|
