Results 1 
5 of
5
Structured programming with go to statements
 Computing Surveys
, 1974
"... A consideration of several different examples sheds new light on the problem of ereating reliable, wellstructured programs that behave efficiently. This study focuses largely on two issues: (a) improved syntax for iterations and error exits, making it possible to write a larger class of programs c ..."
Abstract

Cited by 82 (3 self)
 Add to MetaCart
(Show Context)
A consideration of several different examples sheds new light on the problem of ereating reliable, wellstructured programs that behave efficiently. This study focuses largely on two issues: (a) improved syntax for iterations and error exits, making it possible to write a larger class of programs clearly and efficiently without go to state
Regular algebra applied to pathfinding problems
 Journal of the Institute of Mathematics and Applications
, 1975
"... In an earlier paper, one of the authors presented an algebra for formulating and solving extremal path problems. There are striking similarities between that algebra and the algebra of regular languages, which lead one to consider whether the previous results can be generalized—for instance to path ..."
Abstract

Cited by 37 (8 self)
 Add to MetaCart
In an earlier paper, one of the authors presented an algebra for formulating and solving extremal path problems. There are striking similarities between that algebra and the algebra of regular languages, which lead one to consider whether the previous results can be generalized—for instance to path enumeration problems—and whether the algebra of regular languages can itself be profitably used for the general study of pathfinding problems. This paper gives affirmative answers to both these questions. 1.
Flexible Arithmetic for Huge Numbers with Recursive Series of Operations
"... Abstract. In this paper a recursive expansion of the set of ordinary arithmetical operations is investigated. The addition is considered to be a base of recursion. Next we have multiplication, rising to a power, and so on, up to the infinity. Algebra is considered based on the set of recursive opera ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper a recursive expansion of the set of ordinary arithmetical operations is investigated. The addition is considered to be a base of recursion. Next we have multiplication, rising to a power, and so on, up to the infinity. Algebra is considered based on the set of recursive operations. The variable arithmetical operation a + n b is defined, where n is the level of recursion starting with ordinary + (n=1). The same arithmetical expressions can be interpreted in a various way accordingly to values of some variables. One can use such expressions to build more flexible mathematical models in which not only parameters are able to change but also relationship between parameters (model’s structure). Basic properties of recursive operations are investigated, an algorithm of calculation of expressions of this algebra is considered. The recursive counters ’ apparatus is proposed to be used to represent huge integers, which are the results of recursive operations, in restricted memory. Method based on recursive calculation of a number of digits in the number being represented. The numbers ’ coding tool, offered in this paper, allows acquiring essential part of information included to a huge number without necessity of essential computer resources. 1
The Turing Machine’s Implications for Hardware and Language design
"... Categorization of a computational process by the theoretical model that may execute it, implies executiontime attributes of the memory for code and data, which are reflected in the semantics of the language used to program the process. The executable code of a process corresponds to the Finite Stat ..."
Abstract
 Add to MetaCart
Categorization of a computational process by the theoretical model that may execute it, implies executiontime attributes of the memory for code and data, which are reflected in the semantics of the language used to program the process. The executable code of a process corresponds to the Finite State Machine (FSM) model, including the encoding of any data whose size is known when the FSM is constructed (static memory allocation). Useful processes also have input and output streams, which when interfaced to the FSM, produce the FiniteAutomaton (FA) model. In the most general, Turing Machine (TM) category the amount of temporary information that needs to be stored is not known when its FSM is defined; TM processes need to allocate storage during the execution of the process (dynamic memory allocation). The PushDown Automaton (PDA) model corresponds to a subcategory of TM processes in which the dynamic memory allocation is constrained by the LIFO (lastin, firstout) stack discipline. The PDA model is of primary importance because the executing code of a process has a treestructure; i.e. its subprocesses (programmed as routines, functions, etc) are