MFCS B

51 papers

YearTitle / Authors
1973A Note on Improving Input Strings for Paging Machines.
Hans-Georg Stork
1973An Algebraic Approach to Programs and Their Computations.
Andrzej Blikle
1973An Algebraic Characterization of Stochastic Finite-State Automata and Their Behaviour Functions.
Herbert Küstner
1973An Algebraic Model for Parallel Processes.
J. Horejs
1973Characterization of Programs and Their Synthesis from a Formalized Theory.
Daniele Marini, Pierangelo Miglioli
1973Combinatorial Problems III. Degrees of Combinatorial Problems of Computing Machines.
John P. Cleave
1973Computation and Deduction.
Patrick J. Hayes
1973Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines.
Ivan Korec
1973Computational Optimality of a Dynamic Programming Method.
Jaroslav Morávek
1973Concepts of Net Theory.
C. A. Petri
1973Conditional Metric Completeness of Finite Sets of Automata: A Criterion and an Algorithm (in Russian).
A. A. Donis
1973Construction and Properties of Context-Sensitive Grammars and Languages (in Russian).
L. G. Samoilenko
1973Constructions of Grammars for Formal Languages.
Miroslav Novotný
1973Decision Problems for Multihead Finite Automata.
Philippe Flajolet, Jean-Marc Steyaert
1973Descriptional Complexity of Context-Free Languages.
Jozef Gruska
1973Equations of Formal Power Series over Non Commutative Semiring.
Alberto Bertoni
1973Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow Diagrams.
Karel Culík
1973L-Systems: A Device in Biologically Motivated Automata Theory.
Arto Salomaa
1973Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations.
Claus-Peter Schnorr
1973Machines with Input and Output.
Andrzej Skowron
1973Mathematical Foundation of Information Retrieval.
Zdzislaw Pawlak
1973Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, 1973.
1973Model Theoretical Methods in the Theory of Automata.
Ferenc Gécseg
1973Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded Generators.
Branislav Rovan
1973On Changes of Input/Output Coding.
Michal Chytil
1973On Endomorphism Semigroup of Nilpotent Automata.
I. Peák, N. Q. Khang
1973On Families of Languages Defined by Time-Bounded Random Access Machines.
Ivan Hal Sudborough, A. Zalcberg
1973On Grammatical Complexity of Context-Free Languages (Extended Abstract).
Wilfried Brauer
1973On Ianov Schemas with One Memory Location.
Klaus Indermark
1973On Some Measures on Free Semigroups Induced by Semiautomata.
Dan A. Simovici
1973On Vector Languages.
Armin B. Cremers, Otto Mayer
1973On the Complexity of Countable Functions (Abstract).
Miloslav Nekvinda
1973On the Connectivity of the Periodic Sum of Automata.
Jerzy W. Grzymala-Busse
1973On the Formal Definition of Assembly Languages.
B. Dömölki
1973On the Problem of Finding Natural Computational Complexity Measures.
Juris Hartmanis
1973On the Sequential Relations of Time-Invariant Automata.
Peter H. Starke
1973Operational and Mathematical Semantics for Recursive Polyadic Program Schemata.
Willem P. de Roever
1973Operators on Families of Languages.
Maurice Nivat
1973Relational Structures and Dynamics of Certain Discrete Systems.
Václav Rajlich
1973Semiboolean Algebras of Submachines.
W. Bartol
1973Some Logical Problems of Automated Research.
Petr Hájek
1973Some Results Concerning the Situation Calculus.
Olga Stepánková, Ivan M. Havel
1973Some Sources of Primitive Constructs in Programming Languages.
Jaroslav Král
1973Substitution and (Semi-)AFL.
Seymour Ginsburg
1973The Process Complexity and the Understanding of Sequences.
Robert P. Daley
1973Top-down Analysis of Programming Languages without Backtrack (in Russian).
A. V. Anisimov
1973Towards a Formal Definition of the Control in Structured Programs.
Luigia Carlucci Aiello, Ugo Montanari
1973Towards a Galois Theory of Algorithmic Problems.
Erwin Engeler
1973Towards a Theory of Inductive Inference (in Russian).
Ya. M. Barzdin, K. M. Podineks
1973Tree Transformations via Finite Recursive Transition Machines.
Peter A. Ng, Raymond T. Yeh
1973Turing Machine Recognition.
Pavel Strnad