Concerns about computational problems requiring brute-force or exhaustive search methods have gained particular attention in recent years because of the widespread research on the "P = NP?" question. The Russian word for "brute-force search" is "perebor. " It has been an active research area in the Soviet Union for several decades. Disputes about approaches… (More)
<italic>Denotational semantics for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing) is given by translating programs into an appropriately typed λ-calculus. Procedures are entirely explained at a purely functional level - independent of the interpretation of program constructs - by continuous models… (More)
We consider two orthogonal extensions of the basic nite automaton paradigm and clarify to what degree and in what form do they preserve fundamental facts from the theory of nite automata. Hopefully, this approach facilitates a lucid adaptation of Automata Theory to Hybrid Systems.