Foundations 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

9783540126898, 9783540386827

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Two way finite state generators

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_97 ◽

1983 ◽

pp. 106-114 ◽

Cited By ~ 1

Author(s):

Karel Culik ◽

Emmerich Welzl

Keyword(s):

Finite State

Download Full-text

Deterministic dynamic logic of recursive programs is weaker than dynamic logic

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_90 ◽

1983 ◽

pp. 14-25 ◽

Cited By ~ 1

Author(s):

Piotr Berman

Keyword(s):

Dynamic Logic ◽

Deterministic Dynamic ◽

Recursive Programs

Download Full-text

A new probabilistic model for the study of algorithmic properties of random graph problems

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_118 ◽

1983 ◽

pp. 360-367 ◽

Cited By ~ 4

Author(s):

Marco Protasi ◽

Maurizio Talamo

Keyword(s):

Random Graph ◽

Probabilistic Model ◽

Graph Problems

Download Full-text

Characterizing composability of abstract implementations

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_116 ◽

1983 ◽

pp. 335-346 ◽

Cited By ~ 9

Author(s):

F. Orejas

Download Full-text

Finding dominators

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_115 ◽

1983 ◽

pp. 328-334

Author(s):

Renata Ochranová

Download Full-text

Aspects of programs with finite modes

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_108 ◽

1983 ◽

pp. 241-254 ◽

Cited By ~ 3

Author(s):

H. Langmaack

Download Full-text

On languages generated by semigroups

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_107 ◽

1983 ◽

pp. 232-240

Author(s):

Ladislav Janiga ◽

Václav Koubek

Download Full-text

Reasoning with fairness constraints

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_132 ◽

1983 ◽

pp. 515-517

Author(s):

David Park

Keyword(s):

Fairness Constraints

Download Full-text

Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_130 ◽

1983 ◽

pp. 496-504 ◽

Cited By ~ 3

Author(s):

Paweł Urzyczyn

Keyword(s):

Dynamic Logic ◽

Deterministic Dynamic ◽

Context Free ◽

Free Dynamic

Download Full-text

Modular decomposition of automata (survey)

Foundations of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-12689-9_121 ◽

1983 ◽

pp. 394-412 ◽

Cited By ~ 3

Author(s):

D. Rödding

Keyword(s):

Modular Decomposition

Download Full-text

Foundations of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Two way finite state generators

Deterministic dynamic logic of recursive programs is weaker than dynamic logic

A new probabilistic model for the study of algorithmic properties of random graph problems

Characterizing composability of abstract implementations

Finding dominators

Aspects of programs with finite modes

On languages generated by semigroups

Reasoning with fairness constraints

Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs

Modular decomposition of automata (survey)

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