J. M. Barzdin, J. J. Bičevskis (auth.), Dr. Jíří Bečvář (eds.)3540073892, 9783540073895
Table of contents :
Construction of complete sample system for correctness testing….Pages 1-12
Ten years of speedup….Pages 13-29
On logics of discovery….Pages 30-45
On models of protection in operating systems….Pages 46-60
Parsing as a subtask of compiling….Pages 61-74
Parallel recursive program schemes….Pages 75-87
On some problems concerning Pawlak’s machines….Pages 88-100
Formal power series and growth functions of Lindenmayer systems….Pages 101-113
On the representability of relations by deterministic and nondeterministic multi-tape automata….Pages 114-124
On problems solvable by successive trials….Pages 125-137
Automata and categories….Pages 138-152
On some models of computability of boolean functions….Pages 153-159
Automata and categories: Finiteness contra minimality….Pages 160-166
Languages over free groups….Pages 167-171
On the comparison of notions of approximation….Pages 172-178
Non-linear speed-up theorem for two register minsky machines….Pages 179-185
Systems of open paths in Petri nets….Pages 186-193
On the largest full sub — AFL of the full AFL of context-free languages….Pages 194-198
On complexity of nondeterministic Turing machines computations….Pages 199-205
On closure properties of context-free derivation complexity classes….Pages 206-211
Control structures in single block programs….Pages 212-218
Minimal Gödel numbers and their identification in the limit….Pages 219-225
Isomorphic representation of automata….Pages 226-230
Extended simple regular expressions….Pages 231-237
Conniver programs by logical point of view….Pages 238-245
On the set of all automata with the same monoid of endomorphisms….Pages 246-251
Nondeterministically recognizable sets of languages….Pages 252-257
The approximation problem in computational statistics….Pages 258-265
The continuous algebra of monadic languages….Pages 266-270
On sets of complex-programmed Numbers….Pages 271-272
Decision algorithms for Havel’s branching automata….Pages 273-279
Automata and categories — Input processes….Pages 280-286
Formalization of algorithmic reasoning….Pages 287-293
Proving program properties, symbolic evaluation and logical procedural semantics….Pages 294-301
A contribution to error recovery….Pages 302-307
On the analysis and synthesis problems for context-free expressions….Pages 308-314
Monotone switching circuits and boolean matrix product….Pages 315-319
On some lattice-theoretic properties of generable languages….Pages 320-325
On some formal grammars generating dependency trees….Pages 326-329
Graph walking automata….Pages 330-336
On finding all solutions of the partitioning problem….Pages 337-343
Greibach normal form complexity….Pages 344-350
On correctness and essentiality of some Ianov schemas equivalence relations….Pages 351-357
Polynomially complete problems in the logic of automate discovery….Pages 358-361
Relational definition of computer languages….Pages 362-376
First-order reduction of call-by-name to call-by-value….Pages 377-398
Local disambiguating transformation….Pages 399-404
On cardinal sequential outer measures….Pages 405-410
On representation of sequential and parallel functions….Pages 411-417
The theory of the modified post algebras and multidimensional automata structures….Pages 418-425
An algebraic theory of formal languages….Pages 426-431
On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups….Pages 432-438
On the synthesis of automata with several initial states….Pages 439-444
A hierarchy of regular sequence sets….Pages 445-449
R-fuzzy grammars….Pages 450-456
Characterization of some classes of context-free languages in terms of complexity classes….Pages 457-461
Inductive inference of recursive functions….Pages 462-464
Proving properties of programs by means of predicate logic….Pages 465-471
A generalization of Scott’s flow diagrams….Pages 472-476
Reviews
There are no reviews yet.