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

TOTAL DOCUMENTS

40

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642027369, 9783642027376

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Post Correspondence Problem and Small Dimensional Matrices

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_3 ◽

2009 ◽

pp. 39-46 ◽

Author(s):

Tero Harju

Keyword(s):

Correspondence Problem

Download Full-text

On Equations over Sets of Numbers and Their Limitations

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_29 ◽

2009 ◽

pp. 360-371 ◽

Author(s):

Tommi Lehtinen ◽

Alexander Okhotin

Download Full-text

On Stateless Multihead Finite Automata and Multihead Pushdown Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_19 ◽

2009 ◽

pp. 240-251 ◽

Author(s):

Pierluigi Frisco ◽

Oscar H. Ibarra

Keyword(s):

Finite Automata ◽

Pushdown Automata

Download Full-text

Regular Languages Definable by Majority Quantifiers with Two Variables

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_7 ◽

2009 ◽

pp. 91-102 ◽

Author(s):

Christoph Behle ◽

Andreas Krebs ◽

Stephanie Reifferscheid

Keyword(s):

Regular Languages

Download Full-text

On the Complexity of Deciding Avoidability of Sets of Partial Words

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_9 ◽

2009 ◽

pp. 113-124 ◽

Author(s):

Brandon Blakeley ◽

Francine Blanchet-Sadri ◽

Josh Gunter ◽

Narad Rampersad

Keyword(s):

Download Full-text

Simulations by Time-Bounded Counter Machines

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_33 ◽

2009 ◽

pp. 410-418

Author(s):

Holger Petersen

Keyword(s):

Counter Machines

Download Full-text

Branching-Time Temporal Logics with Minimal Model Quantifiers

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_32 ◽

2009 ◽

pp. 396-409 ◽

Author(s):

Fabio Mogavero ◽

Aniello Murano

Keyword(s):

Minimal Model ◽

Branching Time ◽

Temporal Logics

Download Full-text

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_30 ◽

2009 ◽

pp. 372-383 ◽

Author(s):

Florin Manea ◽

Victor Mitrana ◽

Jose M. Sempere

Download Full-text

Word Equations with One Unknown

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_28 ◽

2009 ◽

pp. 348-359

Author(s):

Markku Laine ◽

Wojciech Plandowski

Keyword(s):

Download Full-text

The Pumping Lemma for Well-Nested Multiple Context-Free Languages

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02737-6_25 ◽

2009 ◽

pp. 312-325 ◽

Author(s):

Makoto Kanazawa

Keyword(s):

Multiple Context ◽

Pumping Lemma ◽

Download Full-text