Conferences in DBLP
Janis Barzdin , Janis Bicevskis , Audris Kalnins Construction of Complete Sample System for Correctness Testing. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:1-12 [Conf ] Peter van Emde Boas Ten Years of Speedup. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:13-29 [Conf ] Petr Hájek On Logics of Discovery. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:30-45 [Conf ] Michael A. Harrison On Models of Protection in Operating Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:46-60 [Conf ] Jaroslav Král , Jirí Demner Parsing as a Subtask of Compiling. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:61-74 [Conf ] Antoni W. Mazurkiewicz Parallel Recursive Program Schemes. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:75-87 [Conf ] Miroslav Novotný On Some Problems Concerning Pawlak's Machines. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:88-100 [Conf ] Arto Salomaa Formal Power Series and Growth Functions of Lindenmayer Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:101-113 [Conf ] Peter H. Starke On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:114-124 [Conf ] Boris A. Trakhtenbrot On Problems Solvable by Successive Trials. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:125-137 [Conf ] Vera Trnková Automate and Categories. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:138-152 [Conf ] I. D. Zaslavskii On Some Models of Computability of Boolean Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:153-159 [Conf ] Jirí Adámek Automata and Categories: Finiteness Contra Minimality. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:160-166 [Conf ] A. V. Anisimov Languages Over Free Groups. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:167-171 [Conf ] Giorgio Ausiello , Marco Protasi On the Comparison of Notions of Approximation. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:172-178 [Conf ] M. Benesová , Ivan Korec Non-Linear Speed-Up Theorem for Two Register Minsky Machines. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:179-185 [Conf ] Eike Best , Hans Albrecht Schmid Systems of Open Paths in Petri Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:186-193 [Conf ] Luc Boasson on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:194-198 [Conf ] Michal Chytil On Complexity of Nondeterministic Turing Machines Computations. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:199-205 [Conf ] Alexander Ja. Dikovsky On Closure Properties of Context-Free Derivation Complexity Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:206-211 [Conf ] Venelin K. Evtimov Control Structures in Single Block Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:212-218 [Conf ] R. V. Freivald Minimal Gödel Numbers and Their Identification in the Limit. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:219-225 [Conf ] Ferenc Gécseg Isomorphic Representation of Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:226-230 [Conf ] Hartmann J. Genrich Extended Simple Regular Expressions. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:231-237 [Conf ] Giuseppina C. Gini , Maria L. Gini Conniver Programs by Logical Point of View. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:238-245 [Conf ] Jerzy W. Grzymala-Busse On the Set of All Automata with the Same Monoid of Endomorphisms. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:246-251 [Conf ] Ivan M. Havel Nondterministically Recognizable Sets of Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:252-257 [Conf ] Tomás Havránek The Approximation Problem in Computational Statistics. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:258-265 [Conf ] Klaus Indermark The Continuous Algebra of Monadic Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:266-270 [Conf ] Max I. Kanovic On Sets of Complex-Programmed Numbers. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:271-272 [Conf ] Marek Karpinski Decision Algorithms for Havel's Branching Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:273-279 [Conf ] Václav Koubek , Jan Reiterman Automata and Categories - Input Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:280-286 [Conf ] Fred Kröger Formalization of Algorithmic Reasoning. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:287-293 [Conf ] Giorgio Levi , Franco Sirovich Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:294-301 [Conf ] Jan Maluszynski A Contribution to Error Recovery. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:302-307 [Conf ] Otto Mayer On the Analysis and Synthesis Problems for Context-Free Expressions. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:308-314 [Conf ] Kurt Mehlhorn , Zvi Galil Monotone Switching Circuits and Boolean Matrix Product. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:315-319 [Conf ] Ivan Mezník On Some Lattice-Theoretic Properties of Generable Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:320-325 [Conf ] Larisa S. Modina On Some Formal Grammars Generating Dependency Trees. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:326-329 [Conf ] Peter A. Ng , Pei Hsia , Raymond T. Yeh Graph Walking Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:330-336 [Conf ] Jürgen Perl On Finding All Solutions of the Partitioning Problem. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:337-343 [Conf ] Alica Pirická-Kelemenová Greibach Normal Form Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:344-350 [Conf ] Rimma I. Podlovchenko On Correctness and Essentiality of Some Ianov Schemas Equivalence Relations. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:351-357 [Conf ] Pavel Pudlák Polynomially Complete Problems in the Logic of Automated Discovery. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:358-361 [Conf ] Vaclav Rajlich Relational definition of Computer Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:362-376 [Conf ] Willem P. de Roever First-Order Reductions of Call-by-Name to Call-by-Value. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:377-398 [Conf ] Peter Ruzicka Local Disambiguating Transformation. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:399-404 [Conf ] Dan A. Simovici On Cardinal Sequential Outer Measures. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:405-410 [Conf ] Mark B. Trakhtenbrot On Representation of Sequential and Parallel Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:411-417 [Conf ] G. E. Tseytlin The Theory of the Modified Post Algebras and Multidimensional Automata Structures. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:418-425 [Conf ] Raymond Turner An Algebraic Theory of Formal Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:426-431 [Conf ] Mars K. Valiev On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:432-438 [Conf ] Rüdiger Valk On the Synthesis of Automata with Several Initial States. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:439-444 [Conf ] Klaus W. Wagner A Hierarchy of Regular Sequence Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:445-449 [Conf ] Wolfgang Wechler R-Fuzzy Grammars. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:450-456 [Conf ] Gerd Wechsung Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:457-461 [Conf ] Rolf Wiehagen Inductive Inference of Recursive Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:462-464 [Conf ] Józef Winkowski Proving Properties of Programs by Means of Predicate Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:465-471 [Conf ] Boleslaw Wojdylo A Generalization of Scott's Flow Diagrams. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:472-476 [Conf ]