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

9783540571636, 9783540479239

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Non erasing Taring machines: a frontier between a decidable halting problem and Universality

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_32 ◽

1993 ◽

pp. 375-385 ◽

Cited By ~ 7

Author(s):

Maurice Margenstern

Keyword(s):

Halting Problem

Download Full-text

Formal languages consisting of primitive words

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_15 ◽

1993 ◽

pp. 194-203 ◽

Cited By ~ 8

Author(s):

P. Dömösi ◽

S. Horváth ◽

M. Ito ◽

L. Kászonyi ◽

M. Katsura

Keyword(s):

Formal Languages ◽

Primitive Words

Download Full-text

Pattern languages: Problems of decidability and generation

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_8 ◽

1993 ◽

pp. 121-132

Author(s):

Arto Salomaa

Keyword(s):

Pattern Languages

Download Full-text

Regular approximations to shuffle products of context-free languages, and convergence of their generating functions

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_30 ◽

1993 ◽

pp. 352-362

Author(s):

Robert S. Maier ◽

René Schott

Keyword(s):

Generating Functions ◽

Context Free

Download Full-text

Maximum covering with D cliques

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_27 ◽

1993 ◽

pp. 319-328 ◽

Cited By ~ 1

Author(s):

Klaus Jansen ◽

Petra Scheffler ◽

Gerhard J. Woeginger

Download Full-text

Simulations between different models of parallel computers

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_2 ◽

1993 ◽

pp. 16-30

Author(s):

Martin Dietzfelbinger

Keyword(s):

Parallel Computers

Download Full-text

Generalized topological sorting in linear time

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_23 ◽

1993 ◽

pp. 279-288 ◽

Cited By ~ 1

Author(s):

Torben Hagerup ◽

Martin Maas

Keyword(s):

Linear Time ◽

Topological Sorting

Download Full-text

Synthesis of O(lg n) testable trees

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_39 ◽

1993 ◽

pp. 452-461

Author(s):

Hongzhong Wu ◽

G. Hotz

Download Full-text

Regular tree languages without unary symbols are star-free

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_34 ◽

1993 ◽

pp. 396-405 ◽

Cited By ~ 9

Author(s):

Andreas Potthoff ◽

Wolfgang Thomas

Keyword(s):

Regular Tree ◽

Tree Languages

Download Full-text

The equational theory of a Boolean monad

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-57163-9_31 ◽

1993 ◽

pp. 363-374

Author(s):

Ernest G. Manes

Keyword(s):

Equational Theory

Download Full-text

Fundamentals of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Non erasing Taring machines: a frontier between a decidable halting problem and Universality

Formal languages consisting of primitive words

Pattern languages: Problems of decidability and generation

Regular approximations to shuffle products of context-free languages, and convergence of their generating functions

Maximum covering with D cliques

Simulations between different models of parallel computers

Generalized topological sorting in linear time

Synthesis of O(lg n) testable trees

Regular tree languages without unary symbols are star-free

The equational theory of a Boolean monad

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