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

• An algebraic theory of formal languages
  Raymond Turner
  Lecture Notes in Computer Science 32, 1975, pp. 426-431
• On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups
  M.K. Valiev
  Lecture Notes in Computer Science 32, 1975, pp. 432-438
• On the synthesis of automata with several initial states
  Rüdiger Valk
  Lecture Notes in Computer Science 32, 1975, pp. 439-444
• A hierarchy of regular sequence sets
  Klaus Wagner
  Lecture Notes in Computer Science 32, 1975, pp. 445-449
• R-fuzzy grammars
  Wolfgang Wechler
  Lecture Notes in Computer Science 32, 1975, pp. 450-456
• Characterization of some classes of context-free languages in terms of complexity classes
  Gerd Wechsung
  Lecture Notes in Computer Science 32, 1975, pp. 457-461
• Inductive inference of recursive functions
  Rolf Wiehagen
  Lecture Notes in Computer Science 32, 1975, pp. 462-464
• Proving properties of programs by means of predicate logic
  Józef Winkowski
  Lecture Notes in Computer Science 32, 1975, pp. 465-471
• A generalization of Scott's flow diagrams
  Bolesƚaw Wojdyƚo
  Lecture Notes in Computer Science 32, 1975, pp. 472-476
• Sequential functions and generalized Moore and Mealy automata
  Jiȓí Bec̑váȓ
  Lecture Notes in Computer Science 28, 1975, pp. 1-8
• Mathematical methods of the theory of stochastic automata
  A. Bertoni
  Lecture Notes in Computer Science 28, 1975, pp. 9-22
• On the quasi-controllability of automata
  L. Beyga
  Lecture Notes in Computer Science 28, 1975, pp. 23-25
• Models for analysis of races in sequential networks
  J. Brzozowski, M. Yoeli
  Lecture Notes in Computer Science 28, 1975, pp. 26-32
• Factorizations, congruences, and the decomposition of automata and systems
  J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright
  Lecture Notes in Computer Science 28, 1975, pp. 33-45
• On the periodic sum and extensions of finite automata
  Jerzy W. Grzymala-Busse
  Lecture Notes in Computer Science 28, 1975, pp. 46-52
• Finite branching automata: Automata theory motivated by problem solving
  Ivan M. Havel
  Lecture Notes in Computer Science 28, 1975, pp. 53-61
• On configurations in cellular automata
  Peter Mikulecký
  Lecture Notes in Computer Science 28, 1975, pp. 62-68
• Finite automata acceptation of infinite sequences
  K. Wagner, L. Staiger
  Lecture Notes in Computer Science 28, 1975, pp. 69-72
• R-fuzzy automata with a time-variant structure
  W. Wechler
  Lecture Notes in Computer Science 28, 1975, pp. 73-76
• Functions computable in the limit by probabilistic machines
  R.V. Freivald
  Lecture Notes in Computer Science 28, 1975, pp. 77-87
• Some properties of limit recursive functions
  B. Goetze, R. Klette
  Lecture Notes in Computer Science 28, 1975, pp. 88-90
• On some approximation problems of continuous computation
  B. Konikowska
  Lecture Notes in Computer Science 28, 1975, pp. 91-106
• Set-theoretic properties of programs in stored program computers
  W. Kwasowiec
  Lecture Notes in Computer Science 28, 1975, pp. 107-113
• Classification of programs of a SPC
  Z. Raś
  Lecture Notes in Computer Science 28, 1975, pp. 114-125
• The algebraic approach to the theory of computing systems
  Jerzy Tiuryn
  Lecture Notes in Computer Science 28, 1975, pp. 126-142