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
  • 1
    Online Resource
    Online Resource
    Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979 (1979)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almafu_9959186255502883
    Format: 1 online resource (VII, 330 p.)
    Edition: 1st ed. 1979.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-35517-0
    Series Statement: Lecture Notes in Computer Science, 67
    Note: Bibliographic Level Mode of Issuance: Monograph , Context-free sets of infinite words -- New aspects of homomorphisms -- Can partial correctness assertions specify programming language semantics? -- An algebraic theory for synchronization -- Storage modification machines -- Negative results on counting -- Strong non-deterministic context-free languages -- Information content characterizations of complexity theoretic properties -- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen -- A new recursion induction principle -- Finite-change automata -- Move rules and trade-offs in the pebble game -- Transition diagrams and strict deterministic grammars -- Exact expressions for some randomness tests -- On storage optimization for automatically generated compilers -- On continuous completions -- A new method to show lower bounds for polynomials which are hard to compute -- On zerotesting-bounded multicounter machines -- When are two effectively given domains identical? -- Sur deux langages linéaires -- An efficient on-line position tree construction algorithm -- Sorting presorted files -- Node-visit optimal 1 – 2 brother trees -- A graph theoretic approach to determinism versus non-determinism -- Une caracterisation de trois varietes de langages bien connues -- Über eine minimale universelle Turing-Maschine -- Sur les varietes de langages et de monoïdes -- Automaten in planaren graphen -- Theoreme de transversale rationnelle pour les automates a pile deterministes -- On the additive complexity of polynomials and some new lower bounds -- Remarks on the nonexistence of some covering grammars -- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-09118-1
    Language: English
    DOI: 10.1007/3-540-09118-1
    URL: http://dx.doi.org/10.1007/3-540-09118-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
    Charité
  • 2
    Online Resource
    Online Resource
    Theoretical computer science : 4th GI Conference, Aachen, March 26 - 28, 1979 (1979)
    Berlin [u.a.] : Springer
    Details
    UID:
    gbv_595132545
    Format: Online-Ressource (VII, 324 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540355175
    Series Statement: Lecture notes in computer science 67
    Content: Context-free sets of infinite words -- New aspects of homomorphisms -- Can partial correctness assertions specify programming language semantics? -- An algebraic theory for synchronization -- Storage modification machines -- Negative results on counting -- Strong non-deterministic context-free languages -- Information content characterizations of complexity theoretic properties -- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen -- A new recursion induction principle -- Finite-change automata -- Move rules and trade-offs in the pebble game -- Transition diagrams and strict deterministic grammars -- Exact expressions for some randomness tests -- On storage optimization for automatically generated compilers -- On continuous completions -- A new method to show lower bounds for polynomials which are hard to compute -- On zerotesting-bounded multicounter machines -- When are two effectively given domains identical? -- Sur deux langages linéaires -- An efficient on-line position tree construction algorithm -- Sorting presorted files -- Node-visit optimal 1 – 2 brother trees -- A graph theoretic approach to determinism versus non-determinism -- Une caracterisation de trois varietes de langages bien connues -- Über eine minimale universelle Turing-Maschine -- Sur les varietes de langages et de monoïdes -- Automaten in planaren graphen -- Theoreme de transversale rationnelle pour les automates a pile deterministes -- On the additive complexity of polynomials and some new lower bounds -- Remarks on the nonexistence of some covering grammars -- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.
    Note: Literaturangaben , Beitr. teilw. engl., teilw. franz., teilw. dt.,
    Additional Edition: ISBN 3540091181
    Additional Edition: ISBN 0387091181
    Additional Edition: ISBN 9783540091189
    Additional Edition: Erscheint auch als Druck-Ausgabe Theoretical computer science Berlin [u.a.] : Springer, 1979 ISBN 3540091181
    Additional Edition: ISBN 0387091181
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    QH 730
    RVK:
    SS 4800
    RVK:
    SS 1979
    RVK:
    ST 130
    Keywords: Automatentheorie ; Formale Sprache ; Datenverarbeitung ; Datenverarbeitung ; Konferenzschrift
    DOI: 10.1007/3-540-09118-1
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: lizenzpflichtig
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
    UB Potsdam
  • 3
    Book
    Book
    Theoretical computer science : 4th GI Conference ; Aachen, March 26-28, 1979 ; [4. GI-Fachtagung Theoretische Informatik] (1979)
    Berlin [u.a.] : Springer
    Details
    UID:
    gbv_023313765
    Format: 324 S. , graph. Darst.
    ISBN: 3540091181 , 0387091181
    Series Statement: Lecture notes in computer science 67
    Note: Literaturangaben
    Additional Edition: Online-Ausg. Theoretical computer science Berlin [u.a.] : Springer, 1979 ISBN 9783540355175
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    QH 730
    RVK:
    ST 130
    RVK:
    SS 1979
    RVK:
    SS 4800
    Keywords: Automatentheorie ; Formale Sprache ; Datenverarbeitung ; Datenverarbeitung ; Konferenzschrift ; Konferenzschrift
    Author information: Weihrauch, Klaus 1943-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
  • 4
    Online Resource
    Online Resource
    Theoretical Computer Science 4th GI Conference : Aachen, March 26–28, 1979 (1979)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947921001402882
    Format: VII, 330 p. , online resource.
    ISBN: 9783540355175
    Series Statement: Lecture Notes in Computer Science, 67
    Note: Context-free sets of infinite words -- New aspects of homomorphisms -- Can partial correctness assertions specify programming language semantics? -- An algebraic theory for synchronization -- Storage modification machines -- Negative results on counting -- Strong non-deterministic context-free languages -- Information content characterizations of complexity theoretic properties -- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen -- A new recursion induction principle -- Finite-change automata -- Move rules and trade-offs in the pebble game -- Transition diagrams and strict deterministic grammars -- Exact expressions for some randomness tests -- On storage optimization for automatically generated compilers -- On continuous completions -- A new method to show lower bounds for polynomials which are hard to compute -- On zerotesting-bounded multicounter machines -- When are two effectively given domains identical? -- Sur deux langages linéaires -- An efficient on-line position tree construction algorithm -- Sorting presorted files -- Node-visit optimal 1 – 2 brother trees -- A graph theoretic approach to determinism versus non-determinism -- Une caracterisation de trois varietes de langages bien connues -- Über eine minimale universelle Turing-Maschine -- Sur les varietes de langages et de monoïdes -- Automaten in planaren graphen -- Theoreme de transversale rationnelle pour les automates a pile deterministes -- On the additive complexity of polynomials and some new lower bounds -- Remarks on the nonexistence of some covering grammars -- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540091189
    Language: English
    DOI: 10.1007/3-540-09118-1
    URL: http://dx.doi.org/10.1007/3-540-09118-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 5
    Online Resource
    Online Resource
    Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979 (1979)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621661102882
    Format: VII, 330 p. , online resource.
    Edition: 1st ed. 1979.
    ISBN: 9783540355175
    Series Statement: Lecture Notes in Computer Science, 67
    Note: Context-free sets of infinite words -- New aspects of homomorphisms -- Can partial correctness assertions specify programming language semantics? -- An algebraic theory for synchronization -- Storage modification machines -- Negative results on counting -- Strong non-deterministic context-free languages -- Information content characterizations of complexity theoretic properties -- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen -- A new recursion induction principle -- Finite-change automata -- Move rules and trade-offs in the pebble game -- Transition diagrams and strict deterministic grammars -- Exact expressions for some randomness tests -- On storage optimization for automatically generated compilers -- On continuous completions -- A new method to show lower bounds for polynomials which are hard to compute -- On zerotesting-bounded multicounter machines -- When are two effectively given domains identical? -- Sur deux langages linéaires -- An efficient on-line position tree construction algorithm -- Sorting presorted files -- Node-visit optimal 1 - 2 brother trees -- A graph theoretic approach to determinism versus non-determinism -- Une caracterisation de trois varietes de langages bien connues -- Über eine minimale universelle Turing-Maschine -- Sur les varietes de langages et de monoïdes -- Automaten in planaren graphen -- Theoreme de transversale rationnelle pour les automates a pile deterministes -- On the additive complexity of polynomials and some new lower bounds -- Remarks on the nonexistence of some covering grammars -- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662166499
    Additional Edition: Printed edition: ISBN 9783540091189
    Language: English
    DOI: 10.1007/3-540-09118-1
    URL: https://doi.org/10.1007/3-540-09118-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 6
    Online Resource
    Online Resource
    Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979 (1979)
    Berlin, Heidelberg : Springer Berlin Heidelberg
    Details
    UID:
    gbv_1649196547
    Format: Online-Ressource
    ISBN: 9783540355175
    Series Statement: Lecture Notes in Computer Science 67
    Additional Edition: ISBN 9783540091189
    Additional Edition: Buchausg. u.d.T. ISBN 978-3-540-09118-9
    Language: English
    DOI: 10.1007/3-540-09118-1
    URL: Volltext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
  • 7
    Online Resource
    Online Resource
    Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979 (1979)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edocfu_9959186255502883
    Format: 1 online resource (VII, 330 p.)
    Edition: 1st ed. 1979.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-35517-0
    Series Statement: Lecture Notes in Computer Science, 67
    Note: Bibliographic Level Mode of Issuance: Monograph , Context-free sets of infinite words -- New aspects of homomorphisms -- Can partial correctness assertions specify programming language semantics? -- An algebraic theory for synchronization -- Storage modification machines -- Negative results on counting -- Strong non-deterministic context-free languages -- Information content characterizations of complexity theoretic properties -- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen -- A new recursion induction principle -- Finite-change automata -- Move rules and trade-offs in the pebble game -- Transition diagrams and strict deterministic grammars -- Exact expressions for some randomness tests -- On storage optimization for automatically generated compilers -- On continuous completions -- A new method to show lower bounds for polynomials which are hard to compute -- On zerotesting-bounded multicounter machines -- When are two effectively given domains identical? -- Sur deux langages linéaires -- An efficient on-line position tree construction algorithm -- Sorting presorted files -- Node-visit optimal 1 – 2 brother trees -- A graph theoretic approach to determinism versus non-determinism -- Une caracterisation de trois varietes de langages bien connues -- Über eine minimale universelle Turing-Maschine -- Sur les varietes de langages et de monoïdes -- Automaten in planaren graphen -- Theoreme de transversale rationnelle pour les automates a pile deterministes -- On the additive complexity of polynomials and some new lower bounds -- Remarks on the nonexistence of some covering grammars -- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-09118-1
    Language: English
    DOI: 10.1007/3-540-09118-1
    URL: http://dx.doi.org/10.1007/3-540-09118-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
  • 8
    Online Resource
    Online Resource
    Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979 (1979)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edoccha_9959186255502883
    Format: 1 online resource (VII, 330 p.)
    Edition: 1st ed. 1979.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-35517-0
    Series Statement: Lecture Notes in Computer Science, 67
    Note: Bibliographic Level Mode of Issuance: Monograph , Context-free sets of infinite words -- New aspects of homomorphisms -- Can partial correctness assertions specify programming language semantics? -- An algebraic theory for synchronization -- Storage modification machines -- Negative results on counting -- Strong non-deterministic context-free languages -- Information content characterizations of complexity theoretic properties -- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen -- A new recursion induction principle -- Finite-change automata -- Move rules and trade-offs in the pebble game -- Transition diagrams and strict deterministic grammars -- Exact expressions for some randomness tests -- On storage optimization for automatically generated compilers -- On continuous completions -- A new method to show lower bounds for polynomials which are hard to compute -- On zerotesting-bounded multicounter machines -- When are two effectively given domains identical? -- Sur deux langages linéaires -- An efficient on-line position tree construction algorithm -- Sorting presorted files -- Node-visit optimal 1 – 2 brother trees -- A graph theoretic approach to determinism versus non-determinism -- Une caracterisation de trois varietes de langages bien connues -- Über eine minimale universelle Turing-Maschine -- Sur les varietes de langages et de monoïdes -- Automaten in planaren graphen -- Theoreme de transversale rationnelle pour les automates a pile deterministes -- On the additive complexity of polynomials and some new lower bounds -- Remarks on the nonexistence of some covering grammars -- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-09118-1
    Language: English
    DOI: 10.1007/3-540-09118-1
    URL: http://dx.doi.org/10.1007/3-540-09118-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Charité
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783540300175?
Did you mean 9783540305170?
Did you mean 9783540326175?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages