Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Die Antwortzeit im Portal kann derzeit länger als üblich sein. Wir bitten um Entschuldigung.
Export
  • 1
    UID:
    b3kat_BV036039444
    Format: 1 Online-Ressource (VII, 324 S.) , graph. Darst.
    ISBN: 3540091181 , 0387091181
    Series Statement: Lecture notes in computer science 67
    Language: English
    Subjects: Economics
    RVK:
    Keywords: Automatentheorie ; Formale Sprache ; Datenverarbeitung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_BV003324737
    Format: VII, 324 S. : , graph. Darst.
    ISBN: 3-540-09118-1 , 0-387-09118-1
    Series Statement: Lecture notes in computer science 67
    Language: English
    Subjects: Economics
    RVK:
    Keywords: Automatentheorie ; Formale Sprache ; Datenverarbeitung ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Author information: Weihrauch, Klaus, 1943-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Show associated volumes
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    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:
    RVK:
    Keywords: Automatentheorie ; Formale Sprache ; Datenverarbeitung ; Datenverarbeitung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Author information: Weihrauch, Klaus 1943-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Show associated volumes
    UID:
    almatuudk_9921321634402884
    Format: 1 online resource (VII, 330 p.)
    Edition: 1st ed. 1979.
    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
    Additional Edition: ISBN 3-540-09118-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    kobvindex_ZLB12688247
    Format: VII, 324 Seiten , graph. Darst.
    Edition: 1
    ISBN: 3540091181 , 0387091181
    Series Statement: Lecture notes in computer science Vol. 67
    Language: German
    Keywords: Informatik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    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
    Author information: Weihrauch, Klaus 1943-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    kobvindex_MFN2793
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages