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

9783540633860, 9783540695295

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Refinement of coloured petri nets

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036175 ◽

1997 ◽

pp. 105-116 ◽

Cited By ~ 2

Author(s):

Eike Best ◽

Thomas Thielke

Keyword(s):

Petri Nets ◽

Coloured Petri Nets

Download Full-text

Locally computable enumerations

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036171 ◽

1997 ◽

pp. 51-66

Author(s):

Antoni Mazurkiewicz

Download Full-text

Bounded concurrency

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036184 ◽

1997 ◽

pp. 198-209 ◽

Cited By ~ 1

Author(s):

Damas P. Gruska

Download Full-text

On occurrence net semantics for petri nets with contacts

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036194 ◽

1997 ◽

pp. 317-328 ◽

Cited By ~ 3

Author(s):

Irina A. Lomazova

Keyword(s):

Petri Nets

Download Full-text

Stochastic analysis of dynamic processes

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036173 ◽

1997 ◽

pp. 85-92

Author(s):

Eli Upfal

Keyword(s):

Stochastic Analysis ◽

Dynamic Processes

Download Full-text

The complexity of error-correcting codes

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036172 ◽

1997 ◽

pp. 67-84 ◽

Cited By ~ 9

Author(s):

Daniel A. Spielman

Keyword(s):

Error Correcting Codes

Download Full-text

On the average complexity of the membership problem for a generalized Dyck language

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036197 ◽

1997 ◽

pp. 352-363

Author(s):

Markus E. Nebel

Keyword(s):

Membership Problem ◽

Average Complexity

Download Full-text

Unique normal forms for nonlinear term rewriting systems: Root overlaps

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036206 ◽

1997 ◽

pp. 452-462 ◽

Cited By ~ 2

Author(s):

Rakesh M. Verma

Keyword(s):

Normal Forms ◽

Nonlinear Term ◽

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Unique Normal Forms

Download Full-text

Concerning the time bounds of existing shortest watchman route algorithms

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036185 ◽

1997 ◽

pp. 210-221 ◽

Cited By ~ 3

Author(s):

Mikael Hammar ◽

Bengt J. Nilsson

Keyword(s):

Time Bounds

Download Full-text

Criteria to disprove context-freeness of collage languages

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0036181 ◽

1997 ◽

pp. 169-178 ◽

Cited By ~ 2

Author(s):

Frank Drewes ◽

Hans-Jörg Kreowski ◽

Denis Lapoire

Download Full-text

Fundamentals of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Refinement of coloured petri nets

Locally computable enumerations

Bounded concurrency

On occurrence net semantics for petri nets with contacts

Stochastic analysis of dynamic processes

The complexity of error-correcting codes

On the average complexity of the membership problem for a generalized Dyck language

Unique normal forms for nonlinear term rewriting systems: Root overlaps

Concerning the time bounds of existing shortest watchman route algorithms

Criteria to disprove context-freeness of collage languages

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