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

TOTAL DOCUMENTS

34

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer International Publishing

9783319214993, 9783319215006

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Deterministic Ordered Restarting Automata that Compute Functions

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_32 ◽

2015 ◽

pp. 401-412

Author(s):

Friedrich Otto ◽

Kent Kwee

Download Full-text

Interval Exchange Words and the Question of Hof, Knill, and Simon

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_30 ◽

2015 ◽

pp. 377-388

Author(s):

Zuzana Masáková ◽

Edita Pelantová ◽

Štěpán Starosta

Keyword(s):

Interval Exchange

Download Full-text

Surminimisation of Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_28 ◽

2015 ◽

pp. 352-363

Author(s):

Victor Marsault

Download Full-text

Squareable Words

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_10 ◽

2015 ◽

pp. 132-142

Author(s):

Francine Blanchet-Sadri ◽

Abraham Rashin

Download Full-text

Complexity Bounds of Constant-Space Quantum Computation

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_34 ◽

2015 ◽

pp. 426-438

Author(s):

Tomoyuki Yamakami

Keyword(s):

Quantum Computation ◽

Complexity Bounds

Download Full-text

Weight Assignment Logic

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_33 ◽

2015 ◽

pp. 413-425

Author(s):

Vitaly Perevoshchikov

Keyword(s):

Weight Assignment

Download Full-text

On Decidability of Intermediate Levels of Concatenation Hierarchies

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_4 ◽

2015 ◽

pp. 58-70 ◽

Author(s):

Jorge Almeida ◽

Jana Bartoňová ◽

Ondřej Klíma ◽

Michal Kunc

Download Full-text

On the Size of Two-Way Reasonable Automata for the Liveness Problem

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_9 ◽

2015 ◽

pp. 120-131 ◽

Author(s):

Maria Paola Bianchi ◽

Juraj Hromkovič ◽

Ivan Kováč

Download Full-text

Consensus Game Acceptors

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_8 ◽

2015 ◽

pp. 108-119

Author(s):

Dietmar Berwanger ◽

Marie van den Bogaard

Download Full-text

Complexity Analysis: Transformation Monoids of Finite Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21500-6_11 ◽

2015 ◽

pp. 143-154 ◽

Author(s):

Christian Brandl ◽

Hans Ulrich Simon

Keyword(s):

Complexity Analysis ◽

Finite Automata ◽

Transformation Monoids

Download Full-text