default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. MFCS 1973: Strbské Pleso, Czechoslovakia
- Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, 1973. Mathematical Institute of the Slovak Academy of Sciences 1973
- Ya. M. Barzdin, K. M. Podineks:
Towards a Theory of Inductive Inference (in Russian). MFCS 1973: 9-15 - Andrzej Blikle:
An Algebraic Approach to Programs and Their Computations. MFCS 1973: 17-26 - Karel Culík:
Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow Diagrams. MFCS 1973: 27-38 - B. Dömölki:
On the Formal Definition of Assembly Languages. MFCS 1973: 39-50 - Erwin Engeler:
Towards a Galois Theory of Algorithmic Problems. MFCS 1973: 51-55 - Ferenc Gécseg:
Model Theoretical Methods in the Theory of Automata. MFCS 1973: 57-63 - Seymour Ginsburg:
Substitution and (Semi-)AFL. MFCS 1973: 65-69 - Jozef Gruska:
Descriptional Complexity of Context-Free Languages. MFCS 1973: 71-83 - Petr Hájek:
Some Logical Problems of Automated Research. MFCS 1973: 85-93 - Juris Hartmanis:
On the Problem of Finding Natural Computational Complexity Measures. MFCS 1973: 95-103 - Patrick J. Hayes:
Computation and Deduction. MFCS 1973: 105-117 - Maurice Nivat:
Operators on Families of Languages. MFCS 1973: 119-124 - Miroslav Novotný:
Constructions of Grammars for Formal Languages. MFCS 1973: 125-133 - Zdzislaw Pawlak:
Mathematical Foundation of Information Retrieval. MFCS 1973: 135-136 - C. A. Petri:
Concepts of Net Theory. MFCS 1973: 137-146 - Arto Salomaa:
L-Systems: A Device in Biologically Motivated Automata Theory. MFCS 1973: 147-151 - Claus-Peter Schnorr:
Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. MFCS 1973: 153-161 - Peter H. Starke:
On the Sequential Relations of Time-Invariant Automata. MFCS 1973: 163-168 - Luigia Carlucci Aiello, Ugo Montanari:
Towards a Formal Definition of the Control in Structured Programs. MFCS 1973: 169-174 - A. V. Anisimov:
Top-down Analysis of Programming Languages without Backtrack (in Russian). MFCS 1973: 175-180 - W. Bartol:
Semiboolean Algebras of Submachines. MFCS 1973: 181-183 - Alberto Bertoni:
Equations of Formal Power Series over Non Commutative Semiring. MFCS 1973: 185-190 - Wilfried Brauer:
On Grammatical Complexity of Context-Free Languages (Extended Abstract). MFCS 1973: 191-196 - Michal Chytil:
On Changes of Input/Output Coding. MFCS 1973: 197-201 - John P. Cleave:
Combinatorial Problems III. Degrees of Combinatorial Problems of Computing Machines. MFCS 1973: 203-207 - Armin B. Cremers, Otto Mayer:
On Vector Languages. MFCS 1973: 209-213 - Robert P. Daley:
The Process Complexity and the Understanding of Sequences. MFCS 1973: 215-218 - A. A. Donis:
Conditional Metric Completeness of Finite Sets of Automata: A Criterion and an Algorithm (in Russian). MFCS 1973: 219-224 - Philippe Flajolet, Jean-Marc Steyaert:
Decision Problems for Multihead Finite Automata. MFCS 1973: 225-230 - Jerzy W. Grzymala-Busse:
On the Connectivity of the Periodic Sum of Automata. MFCS 1973: 231-234 - J. Horejs:
An Algebraic Model for Parallel Processes. MFCS 1973: 235-238 - Klaus Indermark:
On Ianov Schemas with One Memory Location. MFCS 1973: 239-245 - Ivan Korec:
Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines. MFCS 1973: 247-250 - Jaroslav Král:
Some Sources of Primitive Constructs in Programming Languages. MFCS 1973: 251-254 - Herbert Küstner:
An Algebraic Characterization of Stochastic Finite-State Automata and Their Behaviour Functions. MFCS 1973: 255-258 - Daniele Marini, Pierangelo Miglioli:
Characterization of Programs and Their Synthesis from a Formalized Theory. MFCS 1973: 259-266 - Jaroslav Morávek:
Computational Optimality of a Dynamic Programming Method. MFCS 1973: 267-270 - Miloslav Nekvinda:
On the Complexity of Countable Functions (Abstract). MFCS 1973: 271-272 - Peter A. Ng, Raymond T. Yeh:
Tree Transformations via Finite Recursive Transition Machines. MFCS 1973: 273-277 - I. Peák, N. Q. Khang:
On Endomorphism Semigroup of Nilpotent Automata. MFCS 1973: 279-284 - Václav Rajlich:
Relational Structures and Dynamics of Certain Discrete Systems. MFCS 1973: 285-291 - Willem P. de Roever:
Operational and Mathematical Semantics for Recursive Polyadic Program Schemata. MFCS 1973: 293-298 - Branislav Rovan:
Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded Generators. MFCS 1973: 299-305 - L. G. Samoilenko:
Construction and Properties of Context-Sensitive Grammars and Languages (in Russian). MFCS 1973: 307-311 - Dan A. Simovici:
On Some Measures on Free Semigroups Induced by Semiautomata. MFCS 1973: 313-316 - Andrzej Skowron:
Machines with Input and Output. MFCS 1973: 317-319 - Olga Stepánková, Ivan M. Havel:
Some Results Concerning the Situation Calculus. MFCS 1973: 321-326 - Hans-Georg Stork:
A Note on Improving Input Strings for Paging Machines. MFCS 1973: 327-330 - Pavel Strnad:
Turing Machine Recognition. MFCS 1973: 331-332 - Ivan Hal Sudborough, A. Zalcberg:
On Families of Languages Defined by Time-Bounded Random Access Machines. MFCS 1973: 333-338
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-15 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
