Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540108542, 9783540387657

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Mathematical structures underlying greedy algorithms

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_22 ◽

1981 ◽

pp. 205-209 ◽

Cited By ~ 40

Author(s):

B. Korte ◽

L. Lovász

Keyword(s):

Greedy Algorithms ◽

Mathematical Structures

Download Full-text

Analogies of PAL and COPY

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_6 ◽

1981 ◽

pp. 61-70 ◽

Cited By ~ 1

Author(s):

Franz-Josef Brandenburg

Download Full-text

Tape complexity of word problems

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_50 ◽

1981 ◽

pp. 467-471 ◽

Cited By ~ 2

Author(s):

S. Waack

Keyword(s):

Word Problems

Download Full-text

Logical description of computation processes

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_45 ◽

1981 ◽

pp. 410-424

Author(s):

E. Börger

Keyword(s):

Logical Description

Download Full-text

A new operation between languages

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_44 ◽

1981 ◽

pp. 400-409

Author(s):

J. Beauquier

Download Full-text

Extensions of symmetric hom-functors to the Kleisli category

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_43 ◽

1981 ◽

pp. 394-399 ◽

Cited By ~ 2

Author(s):

Jiří Vinárek

Keyword(s):

Kleisli Category

Download Full-text

Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_38 ◽

1981 ◽

pp. 341-349

Author(s):

Detlef Seese

Keyword(s):

Second Order

Download Full-text

Context-free languages of infinite words as least fixpoints

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_33 ◽

1981 ◽

pp. 301-310

Author(s):

Axel Poigné

Keyword(s):

Infinite Words ◽

Context Free

Download Full-text

Generating graph languages using hypergraph grammars

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_16 ◽

1981 ◽

pp. 154-164

Author(s):

D. Janssens ◽

G. Rozenberg

Keyword(s):

Generating Graph ◽

Graph Languages

Download Full-text

A definition of the P = NP-problem in categories

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-10854-8_15 ◽

1981 ◽

pp. 146-153 ◽

Cited By ~ 1

Author(s):

H. Huwig

Keyword(s):

Definition Of ◽

Np Problem

Download Full-text

Fundamentals of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Mathematical structures underlying greedy algorithms

Analogies of PAL and COPY

Tape complexity of word problems

Logical description of computation processes

A new operation between languages

Extensions of symmetric hom-functors to the Kleisli category

Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures

Context-free languages of infinite words as least fixpoints

Generating graph languages using hypergraph grammars

A definition of the P = NP-problem in categories

Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications