Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND YEAR=1975

• On the set of all automata with the same monoid of endomorphisms
  Jerzy W. Grzymala-Busse
  Lecture Notes in Computer Science 32, 1975, pp. 246-251
• Nondeterministically recognizable sets of languages
  Ivan M. Havel
  Lecture Notes in Computer Science 32, 1975, pp. 252-257
• The approximation problem in computational statistics
  Tomás̑ Havránek
  Lecture Notes in Computer Science 32, 1975, pp. 258-265
• The continuous algebra of monadic languages
  Klaus Indermark
  Lecture Notes in Computer Science 32, 1975, pp. 266-270
• On sets of complex-programmed numbers
  Max Kanovic̑
  Lecture Notes in Computer Science 32, 1975, pp. 271-272
• Decision algorithms for Havel's branching automata
  Marek Karpiński
  Lecture Notes in Computer Science 32, 1975, pp. 273-279
• Automata and categories - Input processes
  Václav Koubek, Jan Reiterman
  Lecture Notes in Computer Science 32, 1975, pp. 280-286
• Formalization of algorithmic reasoning
  Fred Kröger
  Lecture Notes in Computer Science 32, 1975, pp. 287-293
• Proving program properties, symbolic evaluation and logical procedural semantics
  Giorgio Levi, Franco Sirovich
  Lecture Notes in Computer Science 32, 1975, pp. 294-301
• A contribution to error recovery
  Jan Maƚuszyński
  Lecture Notes in Computer Science 32, 1975, pp. 302-307
• On the analysis and synthesis problems for context-free expressions
  O. Mayer
  Lecture Notes in Computer Science 32, 1975, pp. 308-314
• Monotone switching circuits and Boolean matrix product
  Kurt Mehlhorn, Zvi Galil
  Lecture Notes in Computer Science 32, 1975, pp. 315-319
• On some lattice-theoretic properties of generable languages
  Ivan Mezník
  Lecture Notes in Computer Science 32, 1975, pp. 320-325
• On some formal grammars generating dependency trees
  L.S. Modina
  Lecture Notes in Computer Science 32, 1975, pp. 326-329
• Graph walking automata
  Peter A. Ng, Pei Hsia, Raymond T. Yeh
  Lecture Notes in Computer Science 32, 1975, pp. 330-336
• On finding all solutions of the partitioning problem
  Jürgen Perl
  Lecture Notes in Computer Science 32, 1975, pp. 337-343
• Greibach normal form complexity
  Alica Pirická-Kelemenová
  Lecture Notes in Computer Science 32, 1975, pp. 344-350
• On correctness and essentiality of some Ianov schemas equivalence relations
  R.I. Podlovchenko
  Lecture Notes in Computer Science 32, 1975, pp. 351-357
• Polynomially complete problems in the logic of automate discovery
  Pavel Pudlák
  Lecture Notes in Computer Science 32, 1975, pp. 358-361
• Relational definition of computer languages
  Václav Rajlich
  Lecture Notes in Computer Science 32, 1975, pp. 362-376
• First-order reduction of call-by-name to call-by-value
  Willem P. de Roever
  Lecture Notes in Computer Science 32, 1975, pp. 377-398
• Local disambiguating transformation
  Peter Ruz̑ic̑ka
  Lecture Notes in Computer Science 32, 1975, pp. 399-404
• On cardinal sequential outer measures
  Dan A. Simovici
  Lecture Notes in Computer Science 32, 1975, pp. 405-410
• On representation of sequential and parallel functions
  Mark B. Trakhtenbrot
  Lecture Notes in Computer Science 32, 1975, pp. 411-417
• The theory of the modified post algebras and multidimensional automata structures
  G.E. Tseytlin
  Lecture Notes in Computer Science 32, 1975, pp. 418-425