-
1
-
Construction of complete sample system for correctness testing
-
13
-
Ten years of speedup
-
30
-
On logics of discovery
-
46
-
On models of protection in operating systems
-
61
-
Parsing as a subtask of compiling
-
75
-
Parallel recursive program schemes
-
88
-
On some problems concerning Pawlak's machines
-
101
-
Formal power series and growth functions of Lindenmayer systems
-
114
-
On the representability of relations by deterministic and nondeterministic multi-tape automata
-
125
-
On problems solvable by successive trials
-
138
-
Automata and categories
-
153
-
On some models of computability of boolean functions
-
160
-
Automata and categories: Finiteness contra minimality
-
167
-
Languages over free groups
-
172
-
On the comparison of notions of approximation
-
179
-
Non-linear speed-up theorem for two register minsky machines
-
186
-
Systems of open paths in Petri nets
-
194
-
On the largest full sub — AFL of the full AFL of context-free languages
-
199
-
On complexity of nondeterministic Turing machines computations
-
206
-
On closure properties of context-free derivation complexity classes
-
212
-
Control structures in single block programs
-
219
-
Minimal Gödel numbers and their identification in the limit
-
226
-
Isomorphic representation of automata
-
231
-
Extended simple regular expressions
-
238
-
Conniver programs by logical point of view
-
246
-
On the set of all automata with the same monoid of endomorphisms
-
252
-
Nondeterministically recognizable sets of languages
-
258
-
The approximation problem in computational statistics
-
266
-
The continuous algebra of monadic languages
-
271
-
On sets of complex-programmed Numbers
-
273
-
Decision algorithms for Havel's branching automata
-
280
-
Automata and categories — Input processes
-
287
-
Formalization of algorithmic reasoning
-
294
-
Proving program properties, symbolic evaluation and logical procedural semantics
-
302
-
A contribution to error recovery
-
308
-
On the analysis and synthesis problems for context-free expressions
-
315
-
Monotone switching circuits and boolean matrix product
-
320
-
On some lattice-theoretic properties of generable languages
-
326
-
On some formal grammars generating dependency trees
-
330
-
Graph walking automata
-
337
-
On finding all solutions of the partitioning problem
-
344
-
Greibach normal form complexity
-
351
-
On correctness and essentiality of some Ianov schemas equivalence relations
-
358
-
Polynomially complete problems in the logic of automate discovery
-
362
-
Relational definition of computer languages
-
377
-
First-order reduction of call-by-name to call-by-value
-
399
-
Local disambiguating transformation
-
405
-
On cardinal sequential outer measures
-
411
-
On representation of sequential and parallel functions
-
418
-
The theory of the modified post algebras and multidimensional automata structures
-
426
-
An algebraic theory of formal languages
-
432
-
On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups
-
439
-
On the synthesis of automata with several initial states
-
445
-
A hierarchy of regular sequence sets
-
450
-
R-fuzzy grammars
-
457
-
Characterization of some classes of context-free languages in terms of complexity classes
-
462
-
Inductive inference of recursive functions
-
465
-
Proving properties of programs by means of predicate logic
-
472
-
A generalization of Scott's flow diagrams
