ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (7,329)
  • Springer  (5,315)
  • Institute of Electrical and Electronics Engineers (IEEE)  (2,014)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • National Academy of Sciences
  • 2015-2019  (5,038)
  • 2005-2009  (1,785)
  • 1990-1994
  • 1980-1984  (506)
  • 2017  (5,038)
  • 2009  (1,785)
  • 1983  (506)
  • Computer Science  (7,329)
Collection
  • Articles  (7,329)
Source
Keywords
Publisher
Years
  • 2015-2019  (5,038)
  • 2005-2009  (1,785)
  • 1990-1994
  • 1980-1984  (506)
Year
Journal
Topic
  • 21
    Electronic Resource
    Electronic Resource
    Book reviews (1983)
    Springer
    Computers and the humanities 17 (1983), S. 215-220 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252808
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    A note on special thue systems with a single defining relation (1983)
    Springer
    Theory of computing systems 16 (1983), S. 57-60 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract It is shown that a Thue system of the formT 1 = {(w,e)} is Church-Rosser if and only if there is a Thue systemT 2 that is Church-Rosser and is equivalent toT 1.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744568
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    Codes and Bernoulli partitions (1983)
    Springer
    Theory of computing systems 16 (1983), S. 133-157 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We associate to a maximal codeX on an alphabetA a dynamical system Ω; our main result proves that the property of unique decipherability implies that the partition of Ω associated to the letters ofA is a Bernoulli partition. Surprisingly it is possible to give two very different proofs of this result: the first one uses probability measures on monoids together with methods from automata theory; the other is based on results of entropy theory.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744574
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    Prolongations and Lyapunov functions in control systems (1983)
    Springer
    Theory of computing systems 16 (1983), S. 233-249 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In contrast to the case of a single dynamical system, the asymptotic stability of orbits of control systems cannot be characterized in terms of suitably defined Lyapunov functions. It is shown that the existence of Lyapunov functions corresponds to a stronger type of asymptotic stability, which is defined by introducing higher prolongations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744578
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Lie and Morse theory for periodic orbits of vector fields and matrix Riccati equations, II (1983)
    Springer
    Theory of computing systems 16 (1983), S. 297-306 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, elementary techniques from linear algebra and elementary properties of the Grassmann manifolds are used to prove the existence of periodic orbits and to study the equilibrium structure of Riccati differential equations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744584
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    Identification and filtering (1983)
    Springer
    Theory of computing systems 16 (1983), S. 307-317 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A theory of the discrete Riccati equation asymptotic behavior for a degenerate filtering problem corresponding to prediction. As an application, ARMA identification is shown to be determined from the asymptotic behavior of the reflection coefficients. Explicitly the time constants of the reflection coefficient sequence determine the moving average portion of the process. This work completes earlier work of the author on “invariant directions” of the Riccati equation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744585
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    On the definitions of some complexity classes of real numbers (1983)
    Springer
    Theory of computing systems 16 (1983), S. 95-109 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Three formulations of computable real numbers based on the concepts of Cauchy sequences, Dedekind cuts, and the binary expansions have been carefully studied. We extend the definitions to recursively enumerable real numbers, and some complexity-bounded classes of real numbers. In particular, polynomial time and nondeterministic polynomial time computable real numbers are defined and compared. Although the three definitions are equivalent for the class of recursive real numbers, they are not equivalent for other classes of real numbers. It seems that the definition based on the concept of Cauchy sequences is the most general one.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744572
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 28
    Electronic Resource
    Electronic Resource
    Some applications of topology to program semantics (1983)
    Springer
    Theory of computing systems 16 (1983), S. 111-131 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The relationship between programs and the set of partial correctness assertions that they satisfy, constitutes a Galois connection. The topology resulting from this Galois connection is closely related to the Lindenbaum baum topology for the language in which these partial correctness assertions are stated. This relationship provides us with a tool for understanding the incompleteness of Hoare Logics and for answering certain natural questions about the connection between the relational semantics and the partial correctness assertion semantics for programs, especially in connection with the question of modularity of programs. Two questions to which we shall find topological answers in this paper are “When is a language expressive for a program?”, and “When can we have rules of inference which are adequate to infer the properties of the complex program ±#β from those of its components ±,β?” We also obtain a natural answer to the question “What can the set{(A, B)|{A}±{B} is true) look like for arbitraryα?”.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744573
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 29
    Electronic Resource
    Electronic Resource
    An axiomatic approach to the Korenjak-Hopcroft algorithms (1983)
    Springer
    Theory of computing systems 16 (1983), S. 191-231 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Several equivalence decision algorithms for classes of grammars, program schemes, transducers follow the general pattern of the Korenjak-Hopcroft algorithm for deciding the equivalence of simple deterministic grammars. An axiomatic framework is presented which points out the essence of the Korenjak-Hopcroft algorithm and applies to numerous situations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744577
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 30
    Electronic Resource
    Electronic Resource
    Matching and spanning in certain planar graphs (1983)
    Springer
    Theory of computing systems 16 (1983), S. 159-183 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Call a connected planar graphG legal if it has at least two nodes, no parallel edges or self-loops and at most two terminals (degree 1 nodes) and all terminals and degree 2 nodes are exterior. This class of graphs arose in connection with a two-dimensional generating system for modeling growth by binary cell division. Showing that any permitted pattern can be generated properly requires a matching or pairing lemma. The vertex set of a legal graph withn nodes can be split intop adjacent pairs ands singletons withs p, resulting in a matching which includes at least $$2\left[ {\frac{n}{3}} \right]$$ nodes. This bound is sharp in the sense that there are legal graphs for which this matching is maximum. The matching can be implemented by a linear time algorithm. A legal graph witht terminals and n≥4 nodes has a spanning tree with at most $$\left[ {\frac{{n - t}}{2}} \right] + t$$ terminals; this bound is sharp. Such a spanning tree can be constructed by an algorithm which operates in almost linear time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01744575
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...