ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (350)
  • Springer  (350)
  • 2005-2009
  • 1980-1984
  • 1965-1969  (350)
  • 1925-1929
  • 1968  (350)
  • Computer Science  (350)
Collection
  • Articles  (350)
Years
  • 2005-2009
  • 1980-1984
  • 1965-1969  (350)
  • 1925-1929
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 139-150 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Diese Arbeit behandelt die numerische Approximation von schwachen Lösungen der ersten Anfangs-Randwertaufgabe für die nichtlineare parabolische Gleichung höherer Ordnung $$\sum\limits_{|\alpha | , |\beta | \leqq p} {D^\alpha (a_{\alpha \beta } (x,t)) \leqq D^\beta u - \partial u/\partial t = f} $$ wof=f(x, t, D v u), |v|≤p−1, p≥1 ganz, und wo α, β,v multi-Indices sind.
    Notes: Summary This paper deals with the numerical approximation of weak solutions of the first initial, boundary value problem for the higher order, nonlinear parabolic equation $$\sum\limits_{|\alpha | , |\beta | \leqq p} {D^\alpha (a_{\alpha \beta } (x,t)) \leqq D^\beta u - \partial u/\partial t = f} $$ wheref=f(x, t, D v u), |v|≤p−1, p≥1 is an integer and α, β,v are multi-indices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 1-8 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary To each subgroupH of the automorphism group of an automaton we may assign the quotient automaton moduloH, if we define the sets of transitivity underH as its internal states. For strongly connected automata, whose automorphism group has a direct productH×L as subgroup, we prove that the quotient group of this automorphism subgroup moduloH is isomorphic to a automorphism group of the quotient automaton moduloH.
    Notes: Zusammenfassung Jeder UntergruppeH der Automorphismengruppe eines Automaten kann der Quotientenautomat nachH zugeordnet werden, wenn man die Transitivitätsklassen bezüglichH als dessen innere Zustände definiert. Für starke Automaten, deren Automorphismengruppe ein direktes ProduktH×L als Untergruppe besitzt, wird bewiesen, daß die Faktorgruppe der Automorphismenuntergruppe nach einem FaktorH isomorph ist zu einer Automorphismengruppe des Quotientenautomaten moduloH.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary Error estimates for approximate solutions ofFredholm integral equations with weakly singular kernels are derived. The approximation scheme is based on the rectangular formula for numerical quadrature. The first part of the paper discusses convergence questions and error estimates for arbitrary kernels, by using the general theory ofKantorowitsch andAkilow. In the second part the estimates are improved for the special case of periodic kernels with logarithmic singularities. It is shown that the approximation is of orderh 3 whereh denotes the step-size in the quadrature formula. The paper concludes with a numerical example, pertaining to the exteriorDirichlet problem for the reduced wave equation.
    Notes: Zusammenfassung Es werden Fehlerabschätzungen für eine Quadraturformel-methode zur LösungFredholmscher Integralgleichungen zweiter Art mit schwachsingulären Kernen gegeben. Im ersten Teil werden Konvergenzaussagen und Abschätzungen für beliebige schwachsinguläre Kerne im Anschluß an die Methoden vonKantorowitsch undAkilow diskutiert. Im zweiten Teil werden die Abschätzungen für periodische Kerne mit logarithmischen Singularitäten verschärft. Es zeigt sich, daß das Verfahren die Ordnungh 3 besitzt, wobeih die Schrittweite in der zugrundegelegten Rechteckformel ist. Ein Zahlenbeispiel, das der Theorie der Außenraumprobleme für dieHelmholtzsche Schwingungsgleichung entnommen ist, zeigt, daß diese Fehlerordnung realistisch ist.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 47-64 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary With the aid of an errorbound arithmetic (see [4]), formulas are given for the computation of approximate valuesplus errorbounds for integrals. In the simplest case,no further information is required about the integrand (e. g. bounds for derivatives, etc.). The formulas can be given for each order of exactitude, the order for the approximate value being, in general, one higher than the order of the errorbounds. Examples show that the errorbounds are generally very sharp. It is possible to use the information given by the errorbounds for the fully automatic ending of the quadrature at the “optimal” point.
    Notes: Zusammenfassung Mit Hilfe einer Fehlerschrankenarithmetik (vgl. [4]) werden Formeln zur Berechnung von Näherungswertenplus Fehlerschranken für bestimmte Integrale angegeben. Im einfachsten Fall werdenkeine weiteren Informationen über den Integranden gefordert (wie etwa Schranken für Ableitungen, etc.). Die Formeln lassen sich für jede Genauigkeitsordnung aufstellen, die Ordnung für den Näherungswert ist i. a. um Eins höher als für die Fehlerschranken. Beispiele zeigen, daß die Schranken sehr scharf sind. Man kann die durch die Schranken vermittelte Information zum vollautomatischen Abbrechen der Quadratur an der “günstigsten” Stelle benutzen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 245-257 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 227-238 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary Many notes deal with the existence problem of solutions for boundary value problems of the kind (1.1). Constructive statements are of a special interest. The first purpose of the following note is to show that it is possible to obtain all the iterative statements about the existence quoted below in a uniform manner. Secondly we will limit the range of convergence of those iteration processes by discussion of some characteristic eigenvalue problem.
    Notes: Zusammenfassung Eine ganze Reihe von Arbeiten beschäftigt sich mit der Frage der Existenz von Lösungen für Randwertprobleme der Art (1.1). Von besonderem Interesse sind dabei die konstruktiven Aussagen. Das Ziel der folgenden Arbeit ist, einmal alle unten zitierten iterativen Existenzaussageneinheitlich zu gewinnen und zum anderen die Grenze des Konvergenzbereiches solcher Iterationsverfahren aufzuzeigen durch die Betrachtung von Eigenwertaufgaben, die für die Probleme kennzeichnend sind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 258-267 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary At first, an interval of convergence is obtained for the relaxation method with a non-negativeJacobi-matrix withpositive diagonal elements (Theorem 3). The asymptotic speed of convergence of the relaxation method is compared to that of the “Einzelschrittverfahren” and the optimal relaxation factor in the interval is given. A further iterative method is considered which may lead to an improved asymptotic convergence speed of the relaxation method. The proof of the assertions rests mainly on Lemma 1 which states that a non-negative convergent matrix has diagonal elements smaller than 1. Further theorems contain similar assertions for more general matrices.
    Notes: Zusammenfassung In der folgenden Arbeit wird zunächst (Satz 3) ein Konvergenzintervall für das Relaxationsverfahren bei einer nichtnegativen Gesamtschrittmatrix mitpositiven Diagonalelementen angegeben. Außerdem wird die asymptotische Konvergenzgeschwindigkeit des Relaxationsverfahrens mit der des Einzelschrittverfahrens verglichen, und der optimale Relaxationsfaktor in diesem Intervall angegeben. Es wird ein weiteres Iterationsverfahren betrachtet, welches eine Verbesserung der asymptotischen Konvergenzgeschwindigkeit des Relaxationsverfahrens liefern kann. Der Beweis dieser Aussagen, beruht u. a. im wesentlichen auf Lemma 1, welches besagt, daß bei einer nichtnegativen konvergenten Matrix die Diagonalglieder notwendig kleiner als Eins sind. — Die weiteren Sätze enthalten ähnliche Aussagen bei allgemeineren Matrizen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 268-279 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir betrachten das folgende Problem: Wie soll die optimale Ordnung der Spalten einer gegebenen sparse Matrize orthonormalisiert werden, so daß die sich ergebende Matrize so sparse wie möglich ist. Es wird gezeigt wie unter gewissen Bedingungen das Optimum bestimmt werden kann. Verschiedene Methoden sind gegeben, welche vom Berechnungsstandpunkt aus einfach sind, und welche eine ziemlich genaue Annäherung an die optimale Spaltenordnung geben. Die Resultate der Berechnungsexperimente, die mit zufällig erzeugten Matrizen durchgeführt wurden, sind auch angegeben. Die Analyse und die Resultate dieser Arbeit gelten für dieGram-Schmidt und auch für dieHouseholdersche Orthonormalisierungsmethode.
    Notes: Summary The problem of finding the optimum order in which the columns of a given sparse matrix should be orthonormalized, such that the resulting matrix is as sparse as possible, is discussed. It is shown how, under certain conditions, the optimum can be determined. Some computationally simple methods, which give a reasonably close approximation to the optimum column order, are given. The results of computational experiments performed on randomly generated matrices are also given. The analysis and the results of the paper hold for both theGram-Schmidt and theHouseholder methods of orthonormalization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 297-310 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Der vorliegende Beitrag versucht automatische Methoden für die Auffindung innewohnender Gleichzeitigkeit in Programmen während der Übersetzung für Parallel-Rechner abzugrenzen. Solche Gleichzeitigkeit sollte auf statische und auf dynamische Weise verwendet werden. Während der Übersetzung werden mehrere unabhängige Rechenwege erzeugt und für parallele Ausführung entsprechend gekennzeichnet. In diesem Zusammenhang wird ein Schema für ein Kontrollprogramm angegeben.
    Notes: Summary The present paper tries to define automatic procedures for detecting inherent paralellism during the compilation of programs in procedural language for parallel-processor computers. This parallelism should be used on a static and a dynamic basis. During compilation several independent paths are detected, generated and properly identified for parallel execution. Also, a scheme is described for an executive routine in this environment.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 318-333 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden Versuchsalgorithmen angewendet um polygonale Annäherungen für die Lösung der funktionalen Gleichungy (t)=Q (t; y) zu konstruieren; der Fall für denQ antiton ist, wird von dem allgemeinen Fall unterschieden. Neben Beispielen mit bekannten Lösungen werden Anwendungen dieser Lösungsmethode für dieVolterrasche Bevölkerungsgleichung $$y(t) \equiv y(0)EXP\left( {\int\limits_0^t {\int\limits_0^\tau {K(\tau ,s,y(s))dsd\tau } } } \right)$$ , für eine Gleichung der Hydrodynamik und für die Differentialgleichung der Zeitverzögerungy (t)=K (y (t), y (t−λ)) gezeigt. Der Anhang enthält FORTRAN IV Programme für den allgemeinen Algorithmus und ebenso partikuläre Quadraturen woQ einfache oder doppelte Integration erfordert.
    Notes: Summary Search algorithms are used to construct a polygonal approximation to a solution to the functional equationy (t)=Q (t; y); the case whereQ is antitone being distinguished from the general case. In addition to examples with known solutions, the techniques are applied to theVolterra population equation $$y(t) \equiv y(0)EXP\left( {\int\limits_0^t {\int\limits_0^\tau {K(\tau ,s,y(s))dsd\tau } } } \right)$$ , an equation from hydrodynamics, and the delay differential equationy (t)=y (0) K (y (t), y (t−λ)). The appendices contain listings of FORTRAN IV programs of the general algorithms as well as particular quadratures whereQ involves single or double integration.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 362-364 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 365-365 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 354-361 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary In the probabilistic theory of round-off errors the distribution of all machine numbers has to be known. At the moment only results are available if this distribution fulfils some regularity conditions [1]. For instanceHenrici [2] assumes uniform distribution of a certain class of binary numbers. Here we study the distribution of the input data in a calculation. We demonstrate, that under fairly general conditions at least the inner binary digits of the input data are uniformly distributed. The range of the uniformly distributed digits is limited to the left by the distribution of the input data and to the right by the precision of measurement. We formulate our results for fixed-point arithmetic. For floating-point arithmetic we have similar results. But since the reasoning in this case gets more involved and no new ideas are necessary, we skip the detailed elaboration here.
    Notes: Zusammenfassung Für die wahrscheinlichkeitstheoretische Behandlung von Rundungsfehlern ist es notwendig, die Verteilung der auftretenden Maschinenzahlen zu kennen. Dabei liegen bisher nur Ergebnisse für den Fall vor, daß diese Verteilung gewisse Regularitätsbedingungen erfüllt [1]. Z. B. nimmtHenrici in [2] Gleichverteilung einer gewissen Klasse von Binärzahlen an. Wir wollen uns hier mit der Verteilung der Eingangsdaten einer Rechnung beschäftigen. Wir zeigen, daß unter sehr allgemeinen Voraussetzungen über die Natur der Eingangsdaten wenigstens ein geeignet gewähltes „Mittelstück” der Binärziffernfolge gleichverteilt ist. Dabei ist dieses Mittelstück gegen die niederen Ziffern durch die Meßgenauigkeit begrenzt, gegen die hohen Ziffern durch die Verteilung der gemessenen Größe. Wir formulieren unsere Ergebnisse für Zahldarstellungen im Festkomma. Bei Darstellungen im Gleitkomma konnten wir für die Mantisse der Gleitkommazahlen entsprechende Ergebnisse erhalten. Die Betrachtungen werden aber wesentlich verwickelter, ohne daß neue Ideen für die Behandlung erforderlich sind, so daß wir auf die Wiedergabe hier verzichten.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 131-138 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit wird eine neue Methode zur numerischen Lösung derFredholmschen Integralgleichung $$\varphi (u) = g (u) + \int\limits_0^1 {k (u, v) \varphi (v) dv} $$ für den Fall einer positiven Kernfunktionk(u, v) beschrieben. Diese Methode ist eine Gradiententechnik, welche sich in der Motivierung von den gewöhnlichen Methoden gänzlich unterscheidet. Sie wird bei einer bestimmten Behandlung von Übertragungsvorgängen durch Strahlung nahegelegt.
    Notes: Summary In this paper, we wish to describe a new approach to the numerical solution of theFredholm integral equation $$\varphi (u) = g (u) + \int\limits_0^1 {k (u, v) \varphi (v) dv} $$ for the case where the kernel functionk(u, v) is positive. Our method is a gradient technique which is quite different in motivation from any of the usual methods. It is suggested by the invariant imbedding treatment of radiative transfer processes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 151-156 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 125-130 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary The computation of lower and upper bounds for solutions of boundary value problems with elliptic differential equation is possible by the application of the boundary maximum theorem. In the present paper we compare two principles: A known method ofChebyshev-approximation for uniformly optimal bounds and a new method of optimization for locally optimal bounds. For the second principle we prove an existence theorem and discuss the extension to composite regions and the application ofNewtons method.
    Notes: Zusammenfassung Bei der Berechnung von unteren und oberen Schranken für Lösungen von Randwertaufgaben mit elliptischer Differentialgleichung kann der Randmaximumsatz verwendet werden. In diesem Beitrag werden zwei Prinzipien verglichen: Ein bekanntes Verfahren derTschebyscheff-Approximation für gleichmäßig optimale Schranken und ein neues Optimierungsverfahren für lokal optimale Schranken. Für das zweite Prinzip wird ein Existenzsatz bewiesen und die Erweiterung auf zusammengesetzte Bereiche und die Anwendung desNewton-Verfahrens besprochen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 157-164 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 165-183 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary Starting from local rational approximations of type (m, n) in the sense ofPadé, a class of higher-order iteration functions for the numerical solution of equations of the formf (x)=0 is constructed. Special cases aren=0, which results in the method ofEhrmann, andm=1, which leads to a new proof ofKönigs theorem. The comparison of various methods, with special reference to the region of convergence and the asymptotic error constant, demonstrates the frequent efficiency of the iterations obtained in this manner. The well-known fact, that approximation near the principal diagonal of thePadé-table yields expecially good results should also be observed at this point. Finally there is an indication how attention to function-theoretic properties facilitates the selection of, in a certain sense, the most suitable method for a givenf (x).
    Notes: Zusammenfassung Ausgehend von lokalen rationalen Approximationen vom Typ (m, n) im Sinne vonPadé wird eine Klasse von Iterationsverfahren höherer Ordnung zur numerischen Auflösung von Gleichungen der Formf (x)=0 konstruiert. Fürn=0 ergeben sich speziell dieEhrmannschen Verfahren [3], während die Annäherungen vom Typ (1,n) zu einer neuen Herleitung der Verfahren vonKönig [8] führen. Der Vergleich verschiedener Verfahren, insbesondere im Hinblick auf Einzugsgebiete und Größe der asymptotischen Fehler zeigt die in vielen Fällen günstigen numerischen Eigenschaften der auf diese Weise erhaltenen Verfahren. Die bekannte Erscheinung, daß Approximationen in der Nähe der Hauptdiagonale derPadé-Tafel besonders gute Ergebnisse liefern, kann auch hier beobachtet werden. Schließlich ergibt sich ein Hinweis darauf, wie durch Beachtung funktionentheoretischer Eigenschaften vonf (x) die Auswahl der in gewissem Sinne besten Verfahren erleichtert wird.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 286-296 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Nach einem Überblick über die Stabilitätsstruktur derPC-Verfahren wird eine einfache aber wirkungsvolle Methode zur Stabilitätsverbesserung erläutert: Die Wahl geeigneter Linearkombinationen von “predicted” und “corrected” Werten führt zu einer beträchtlichen Erweiterung der Stabilitätsgebiete. Weiter wird gezeigt, wie hybridek-Schritt-Verfahren konstruiert werden können, die optimal stabil in einem angegebenen Sinn sind.
    Notes: Summary After a review of the stability structure ofPC-methods, a simple but effective idea is presented for the improvement of the stability ofPC-schemes: By choosing suitable linear combinations of predicted and corrected values one can considerably extend the regions of stability. Furthermore, it is indicated howk-step methods of a hybrid type can be designed which are optimally stable in a certain sense.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 280-285 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden zwei leicht nachprüfbare Bedingungen hergeleitet, welche fürA-Stabilität von linearen Mehrschrittverfahren hinreichend und “fast notwendig” sind. Als Beispiel werden diese Bedingungen auf die zweiparametrige Klasse aller Zweischrittverfahren von mindestens zweiter Ordnung angewendet.
    Notes: Summary Two easy-to-check conditions are given which, together, are sufficient and “almost necessary” forA-stability of linear multistep integration formulae. As an example, these conditions are applied to the two-parameter family of all two-step methods which are at least second-order accurate.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 311-317 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary The context-sensitive languages do not constitute the total class of languages generated by algorithms. Nevertheless various problems (FERMAT) can be embedded in problems of decidability on context-sensitive grammars. The problems here considered are not only of algebraic interest but treat the transformation of languages by homomorphisms and so concern the simplification of language analysing. Unfortunately the questions examined here are undecidable.
    Notes: Zusammenfassung Die kontextsensitiven Sprachen bilden nicht die allgemeinste Klasse algorithmisch erzeugbarer Sprachen. Dennoch lassen sich vielfältige Probleme (FERMAT) in Entscheidbarkeitsfragen über kontextsensitive Sprachen einbetten. Die hier behandelten Probleme sind sowohl von algebraischem Interesse, als auch für die Umformung von Sprachen durch Homomorphismen und damit für die Analyse wichtig. Leider sind alle gestellten Probleme nicht entscheidbar.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 114-116 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 120-124 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 125-127 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 130-132 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 155-158 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 203-204 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 207-208 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 211-213 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 117-120 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract As an addition to the report by McDonough in CHum,II (1967), 37–40, Delatte lists the operations of the Laboratoire d'Analyse statistique des Langues Anciennes at Liège. He describes eight programs for automatic processing, automatic composition and printing of concordances, and various statistical operations. Forty-three Latin works and five Greek, totaling approximately 600,000 words, are catalogued.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 124-124 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 128-129 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 133-144 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 159-176 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 202-202 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 205-206 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 222-222 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 264-268 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 14-14 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 25-29 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 49-52 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 86-86 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 105-118 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 1-13 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 15-24 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 41-48 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 61-64 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 65-86 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 104-104 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 128-128 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 64-64 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 53-60 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 87-104 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 119-128 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 145-154 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 177-202 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 221-221 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 223-250 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 251-263 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 30-30 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 101-113 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract Despite its concentration on technical developments in library science, this survey is offered here because it is relevant to humanists for two reasons: first, that humanists all use libraries and therefore need to encourage their evolution to higher levels of efficiency, and, second, that the procedures outlined here may be of help to humanists in establishing procedures for their own research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 209-210 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 214-214 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 2 (1968), S. 215-220 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 3 (1968), S. 31-40 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Conclusion The common theme running through our discussion of both modes of adaptation to computer technology and problem areas in effective computer-assisted research is the relationship between computer expertise and scholarly research. Knowledge about computers is currently gained by social scientists and humanists in a wide variety of fashions. There are very few formal instructional programs, and most computer skills are obtained on the job. Although it is impossible at this stage to specify in detail either the content or the prerequisites for computer instructional programs for scholars in the social sciences and the humanities, I would recommend for consideration on the following general points. Investigators should have a basic understanding of the design and logic of computers. This knowledge will enable them to have a clearer concept of computers as symbol manipulating devices capable of both arithmetic and logical operations. However, very few investigators will ever use a computer at the level of its basic machine language. Therefore, investigators should learn to solve problems in higher level languages. I consider it essential that they learn at least two such languages, including both numerical and character manipulations. This kind of comprehensive instructional program will assist investigators in exercising greater control over the computer-assisted phases of research; it should allow them wider flexibility in selecting computer techniques appropriate for the research design; and finally, it will allow greater ease in adapting to future advances in computers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 147-158 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 159-177 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given a setC of strings of rewriting rules of a phrase structure grammarG, we consider the setL c (G) of those words generated by leftmost derivations inG whose corresponding string of rewriting rules is an element ofC. The paper concerns the nature of the setL c (G) whenC andG are assumed to have special form. For example, forG an arbitrary phrase structure grammar,L c (G) is an abstract family of languages ifC is an abstract family of languages, andL c (G) is bounded ifC is bounded.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 127-145 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract “Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of this process when some of the attributes are “synthesized”, i.e., defined solely in terms of attributes of thedescendants of the corresponding nonterminal symbol, while other attributes are “inherited”, i.e., defined in terms of attributes of theancestors of the nonterminal symbol. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal specification of semantics which have appeared in the literature.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 203-222 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 179-190 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 195-202 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 191-194 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 223-245 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The problem of finding a stochastic sequential machine with minimal number of states and homomorphic to a given machine is studied in various aspects. The methods used for investigating the above problem are based upon the properties of a certain convex polyhedron associated with the given machine.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 247-249 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 381-381 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 1-6 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A general set of conditions is given under which a property is undecidable for a family of languages. Examples are given of the application of this result to wellknown families of languages.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 363-379 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 381-381 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 17-25 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 83-90 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 51-56 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 93-95 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 7-15 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 27-50 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 57-81 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which finite algebras take the place of finite automata. The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented. The theorems of the generalized theory are then applied to obtain a positive solution to a decision problem of second-order logic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 91-92 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 97-125 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 257-263 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Then-dimensional origin-crossing language,O n, is a language each of whose words describes a walk throughn-dimensional space beginning and ending at the origin. For eachn, O n is real-time recognizable by ann-counter machine but not by any (n — 1)-counter machine. In contrast, for alln, O n is real-time recognizable by a one-tape Turing machine.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 251-256 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 265-283 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The languages recognizable by time- and space-restricted multiple-counter machines are compared to the languages recognizable by similarly restricted multipletape Turing machines. Special emphasis is placed on languages definable by machines which operate in “real time”. Time and space requirements for counter machines and Turing machines are analyzed. A number of questions which remain open for time-restricted Turing machines are settled for their counter machine counterparts.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 325-339 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 357-361 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 287-318 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 319-324 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 2 (1968), S. 341-355 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 9-21 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary A number of works have already appeared in American and German literature with digital solutions of the most difficult part of the root-locus method, the construction of the root-locus. In this report is to be found the mathematical formulation and the programme order, which has the purpose, with logical certainty to accept and automatically trace root-loci in all their branches however complicated the result. The calculation of the root-locus branches is not solved here with the help of a polynomial zero position programme, as various authors have done [9], [12], but makes use of the approximation of the root-locus. The solution of the main difficulties with break away points, as with several break away points one after another of any order of magnitude and smallK-variation in their proximity, is stated. Finally the programme enables an extension for the calculation of any phase and orthogonal gain loci, which is possible without difficulty as a result of the chosen mathematical formulation. The method scaling the drawing for definite value ofK at 0° and 180° is explained. The work is concluded with six examples which were made with the calculating and tracing machines.
    Notes: Zusammenfassung Es sind bereits mehrere Arbeiten in der amerikanischen und deutschen Literatur erschienen, die den schwierigsten Teil des Wurzelortskurvenverfahrens, die Konstruktion der Wurzelortskurve, digital lösen. Dieser Aufsatz gibt die mathematische Formulierung und die Logik eines Programmablaufs wieder, der zum Ziel hat, die Wurzelortskurve mit logischer Sicherheit in allen ihren Zweigen bei beliebiger Kompliziertheit des Ergebnisses zu erfassen und automatisch aufzuzeichnen. Die Berechnung der Wurzelortskurvenzweige wird nicht mit Hilfe eines Polynomnullstellenprogramms gelöst, wie es verschiedene Autoren [9], [12] getan haben, sondern nutzt hier die Nähe der Wurzelortskurve funktionentheoretisch aus. Die Lösung der Hauptschwierigkeiten, mit Verzweigungspunkten sowie auch mehreren hintereinander gelegenen Verzweigungspunkten beliebiger Ordnung und der geringenK-Änderung in deren Umgebung fertig zu werden, wird angegeben. Schließlich erfährt das Programm, was infolge der gewählten mathematischen Formulierung ohne Aufwand möglich ist, eine Erweiterung auf die Berechnung beliebiger Phasen- und Betragsortskurven. Das Prinzip für das Anbringen von Markierungen für ausgezeichnete Werte vonK der Phase 0° und 180° wird erläutert. Sechs Beispiele, wie sie von Rechner und Zeichenmaschine erstellt wurden, schließen die Arbeit ab.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In diesem Aufsatz wird besprochen wie mit Hilfe einer elektronischen Rechenmaschine stationäre lineare autoregressive Reihen der Ordnungp (M p -Reihen genannt) konstruiert werden können. Nachdem die Beziehungen zwischen den Autokorrelationskoeffizienten abgeleitet worden sind, wird ein Schema und ein Flußdiagramm zur Erzeugung vonM p -Reihen gegeben, die vorgegebene Autokorrelationskoeffizienten ϱ1,...ϱ p besitzen. Das Ergebnis lautet: EineM p -Reihe für eine Gruppe von gegebenen Werten ϱ1,...ϱ p ist nur möglich, wenn eineM q -Reihe für jede Untergruppe ϱ1,...ϱ q mitq=1, 2, ...p−1 möglich ist. Wenn einmal eineM p -Reihe mit gegebenen ϱ1,...ϱ p existiert, dann existiert ebenfalls jedeM q -Reihe mit ϱ1,...ϱ q , wobei 1≤q〈p ist. Die Fällep=1, 2, 3 werden ausführlich behandelt, während die Abb. 4 numerische Beispiele fürp=1 undp=2 zeigt.
    Notes: Summary This paper deals with the generation of stationaryp th order linear autoregressive series (calledM p -series) on an electronic computer. The interrelations between the coefficients of autocorrelation are discussed and a device and a flow diagram are given for the generation ofM p -series which possess the autocorrelation coefficients ϱ1, ϱ2,...ϱ p . The conclusion is that there is anM p -series for a given set of values only if there is anM q -series for any subset ϱ1,...ϱ q withq=1,2,...q−1 and that, conversely, if there is anM p -series for given ϱ1,ϱ2,...ϱ p , there is also anM q -series with ϱ1,...ϱ q for 1≤q〈p. The series withp=1, 2, 3 are treated fully and numerical examples forp=1 andp=2 are given in Fig. 4.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 76-77 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 78-79 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...