K. R. Apt, J. W. de Bakker (auth.), Antoni Mazurkiewicz (eds.)3540078541, 9783540078548
Table of contents :
Exercises in denotational semantics….Pages 1-11
W-automata and their languages….Pages 12-22
On semantic issues in the relational model of data….Pages 23-38
The effective arrangement of logical systems….Pages 39-51
Recursivity, sequence recursivity, stack recursivity and semantics of programs….Pages 52-64
Descriptional complexity (of languages) a short survey….Pages 65-80
On the branching structure of languages….Pages 81-98
Algorithms and real numbers….Pages 99-104
On mappings of machines….Pages 105-114
Recent results on L systems….Pages 115-123
Decision problems for multi-tape automata….Pages 124-136
Recursive program schemes and computable functionals….Pages 137-152
Some fundamentals of order-algebraic semantics….Pages 153-168
On attribute grammars….Pages 169-172
Formal definition of semantics of generalized control regimes….Pages 173-179
Minimal while programs….Pages 180-186
On specific features of recognizable families of languages….Pages 187-193
On the termination of simple computer programs….Pages 194-201
Reduction of Petri-nets….Pages 202-209
On behaviour of R-fuzzy automata….Pages 210-215
Cannonizing reducibility method in the theory of program schemata….Pages 216-223
Strongly connected G-S-M mappings preserving conjugation….Pages 224-229
Analysis of the non-context-free component of formal languages….Pages 230-236
Programs, computations and temporal features….Pages 237-243
A note on the automatic generation of inductive assertions….Pages 244-249
On the relationship between a procedure and its data….Pages 250-254
On the relativization of deterministic and nondeterministic complexity classes….Pages 255-259
The metric properties on the semigroups and the languages….Pages 260-264
A lower bound of 1/2n 2 on linear search programs for the knapsack problem….Pages 265-269
The direct product of automata and quasi-automata….Pages 270-276
An axiomatic approach to information structures….Pages 277-283
Parallelism of manipulations in multidimensional information structures….Pages 284-293
On strict interpretations of grammar forms….Pages 294-298
A hierarchy of context-sensitive languages….Pages 299-303
On consecutive storage of records….Pages 304-310
A remark on equivalence of Mazurkiewicz’s finite — control algorithms over nets….Pages 311-316
Microprogram — Oriented model of the controlled structure….Pages 317-322
Relations between programs with different storage requirements….Pages 323-329
An algebraic approach to data types, program verification, and program synthesis….Pages 330-336
About three equational classes of languages built up by shuffle operations….Pages 337-344
A machine independent description of complexity classes, definable by nondeterministic as well as deterministic turing machines with primitiv recursive tape or time bounds….Pages 345-351
Schemes with recursion on higher types….Pages 352-358
Constructing iterative version of a system of recursive procedures….Pages 359-363
A method using a set-theoretical formalism to describe the semantics of programming languages….Pages 364-371
The cubic search method….Pages 372-376
Vectors of coroutines….Pages 377-384
One — one degrees of Turing machines decision problems….Pages 385-389
Heuristic representation of state-space by finite automaton….Pages 390-394
Semigroup characterizations of some language varieties….Pages 395-403
On memory requirements of Strassen’s algorithms….Pages 404-407
Determinism in concurrent systems….Pages 408-415
Generating control mechanisms by restrictions….Pages 416-422
On diagnosis of algorithmical processes….Pages 423-429
On some properties of cyclic automata and their extensions….Pages 430-435
Compiler generation using denotational semantics….Pages 436-441
On divergence problem for program schemas….Pages 442-445
On the parsing of LL-regular grammars….Pages 446-452
The characteristic polynomial of a finite automaton….Pages 453-457
Error detection using regular languages….Pages 458-464
On a relationship between programs of address machines and Mazurkiewicz algorithms….Pages 465-471
DIJKSTRA’s predicate transformer, non-determinism, recursion, and termination….Pages 472-481
Context-free programmed grammars and ETOL systems….Pages 482-487
Context-free algebra: A mathematical device for compiler specification….Pages 488-494
On the lower bound for minimum comparison selection….Pages 495-502
Computational processes generated by programs with /recursive/ procedures and block structures….Pages 503-509
An algebraic framework for the study of the syntactic monoids application to the group languages….Pages 510-516
Degrees of parallelism in computations….Pages 517-523
On adaptability of a system of programs….Pages 524-529
A mathematical model of parallel information processing….Pages 530-536
Powerdomains….Pages 537-543
On the domain of iteration in iterative algebraic theories….Pages 544-550
The influence of the data presentation on the computational power of machines….Pages 551-558
On sequential modelling of non-sequential processes….Pages 559-568
Equivalence and optimization of recursive program schemata….Pages 569-575
Observability concepts in abstract data type specification….Pages 576-587
The calculus of facts….Pages 588-595
Multiplicity functions on ω-automata….Pages 596-601
A complete axiomatic characterization of algorithmic properties of block-structured programs with procedures….Pages 602-606
Reviews
There are no reviews yet.