Developments in Language Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

37

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540404316, 9783540450054

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Safety Verification for Two-Way Finite Automata with Monotonic Counters

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_29 ◽

2003 ◽

pp. 326-338 ◽

Author(s):

Oscar H. Ibarra ◽

Zhe Dang ◽

Zhi-Wei Sun

Keyword(s):

Finite Automata ◽

Safety Verification

Download Full-text

Tiling Systems over Infinite Pictures and Their Acceptance Conditions

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_26 ◽

2003 ◽

pp. 297-306 ◽

Author(s):

Jan-Henrik Altenbernd ◽

Wolfgang Thomas ◽

Stefan Wöhrle

Keyword(s):

Download Full-text

A Unique Structure of Two-Generated Binary Equality Sets

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_21 ◽

2003 ◽

pp. 245-257 ◽

Author(s):

Štěpán Holub

Keyword(s):

Unique Structure

Download Full-text

Computational Processes in Living Cells: Gene Assembly in Ciliates

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_1 ◽

2003 ◽

pp. 1-20 ◽

Author(s):

Tero Harju ◽

Grzegorz Rozenberg

Keyword(s):

Living Cells ◽

Gene Assembly ◽

Computational Processes

Download Full-text

Characteristic Semigroups of Directable Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_37 ◽

2003 ◽

pp. 417-427 ◽

Author(s):

Tatjana Petković ◽

Miroslav Ćirić ◽

Stojan Bogdanović

Download Full-text

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_4 ◽

2003 ◽

pp. 43-58 ◽

Author(s):

Zoltán Ésik

Keyword(s):

Temporal Logic ◽

Download Full-text

An Inverse Automata Algorithm for Recognizing 2-Collapsing Words

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_23 ◽

2003 ◽

pp. 270-282 ◽

Author(s):

Dmitry S. Ananichev ◽

Alessandra Cherubini ◽

Mikhail V. Volkov

Download Full-text

On the Descriptional Complexity of Some Variants of Lindenmayer Systems

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_11 ◽

2003 ◽

pp. 128-140 ◽

Author(s):

Jürgen Dassow ◽

Taishin Nishida ◽

Bernd Reichel

Keyword(s):

Lindenmayer Systems ◽

Descriptional Complexity

Download Full-text

Circular Words Avoiding Patterns

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_28 ◽

2003 ◽

pp. 319-325 ◽

Author(s):

James D. Currie ◽

D. Sean Fitzpatrick

Download Full-text

Some Remarks on Asynchronous Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45005-x_25 ◽

2003 ◽

pp. 290-296

Author(s):

Balázs Imreh

Keyword(s):

Asynchronous Automata

Download Full-text