Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

26

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642393099, 9783642393105

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Size of Unary One-Way Multi-head Finite Automata

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_15 ◽

2013 ◽

pp. 148-159 ◽

Author(s):

Martin Kutrib ◽

Andreas Malcher ◽

Matthias Wendlandt

Keyword(s):

Finite Automata

Download Full-text

State Complexity of Basic Operations on Non-returning Regular Languages

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_7 ◽

2013 ◽

pp. 54-65 ◽

Author(s):

Hae-Sung Eom ◽

Yo-Sub Han ◽

Galina Jirásková

Keyword(s):

Regular Languages ◽

State Complexity

Download Full-text

The Power of Centralized PC Systems of Pushdown Automata

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_23 ◽

2013 ◽

pp. 241-252 ◽

Author(s):

Holger Petersen

Keyword(s):

Pushdown Automata

Download Full-text

Invertible Transductions and Iteration

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_4 ◽

2013 ◽

pp. 18-29 ◽

Author(s):

Klaus Sutner

Download Full-text

Millstream Systems and Graph Transformation for Complex Linguistic Models

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_2 ◽

2013 ◽

pp. 14-16

Author(s):

Frank Drewes

Keyword(s):

Graph Transformation ◽

Linguistic Models

Download Full-text

Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_16 ◽

2013 ◽

pp. 160-171 ◽

Author(s):

Janusz Brzozowski ◽

Baiyu Li

Keyword(s):

Regular Languages ◽

Syntactic Complexity

Download Full-text

Queue Automata of Constant Length

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_13 ◽

2013 ◽

pp. 124-135 ◽

Author(s):

Sebastian Jakobi ◽

Katja Meckel ◽

Carlo Mereghetti ◽

Beatrice Palano

Keyword(s):

Constant Length

Download Full-text

Nondeterministic Biautomata and Their Descriptional Complexity

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_12 ◽

2013 ◽

pp. 112-123 ◽

Author(s):

Markus Holzer ◽

Sebastian Jakobi

Keyword(s):

Descriptional Complexity

Download Full-text

Nondeterministic State Complexity of Proportional Removals

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_11 ◽

2013 ◽

pp. 102-111 ◽

Author(s):

Daniel Goč ◽

Alexandros Palioudakis ◽

Kai Salomaa

Keyword(s):

State Complexity ◽

Nondeterministic State

Download Full-text

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39310-5_9 ◽

2013 ◽

pp. 78-89 ◽

Author(s):

Hae-Sung Eom ◽

Yo-Sub Han ◽

Kai Salomaa

Keyword(s):

Regular Languages ◽

State Complexity

Download Full-text