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

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer International Publishing

9783319192246, 9783319192253

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Star-Complement-Star on Prefix-Free Languages

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

10.1007/978-3-319-19225-3_20 ◽

2015 ◽

pp. 231-242 ◽

Author(s):

Matúš Palmovský ◽

Juraj Šebej

Download Full-text

Quantum Queries on Permutations

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

10.1007/978-3-319-19225-3_15 ◽

2015 ◽

pp. 177-184 ◽

Author(s):

Taisia Mischenko-Slatenkova ◽

Alina Vasilieva ◽

Ilja Kucevalovs ◽

Rūsiņš Freivalds

Download Full-text

Unambiguity in Automata Theory

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

10.1007/978-3-319-19225-3_1 ◽

2015 ◽

pp. 3-18 ◽

Author(s):

Thomas Colcombet

Keyword(s):

Automata Theory

Download Full-text

Universal Disjunctive Concatenation and Star

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

10.1007/978-3-319-19225-3_17 ◽

2015 ◽

pp. 197-208

Author(s):

Nelma Moreira ◽

Giovanni Pighizzini ◽

Rogério Reis

Download Full-text

Partial Derivative Automaton for Regular Expressions with Shuffle

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

10.1007/978-3-319-19225-3_2 ◽

2015 ◽

pp. 21-32 ◽

Author(s):

Sabine Broda ◽

António Machiavelo ◽

Nelma Moreira ◽

Rogério Reis

Keyword(s):

Partial Derivative ◽

Regular Expressions

Download Full-text

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems

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

10.1007/978-3-319-19225-3_12 ◽

2015 ◽

pp. 141-152 ◽

Author(s):

Lila Kari ◽

Stavros Konstantinidis ◽

Steffen Kopecki

Download Full-text

Compressibility of Finite Languages by Grammars

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

10.1007/978-3-319-19225-3_8 ◽

2015 ◽

pp. 93-104 ◽

Author(s):

Sebastian Eberhard ◽

Stefan Hetzl

Download Full-text

On Simulation Cost of Unary Limited Automata

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

10.1007/978-3-319-19225-3_13 ◽

2015 ◽

pp. 153-164 ◽

Author(s):

Martin Kutrib ◽

Matthias Wendlandt

Download Full-text

On the Complexity and Decidability of Some Problems Involving Shuffle

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

10.1007/978-3-319-19225-3_9 ◽

2015 ◽

pp. 105-116

Author(s):

Joey Eremondi ◽

Oscar H. Ibarra ◽

Ian McQuillan

Download Full-text

Groups Whose Word Problem is a Petri Net Language

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

10.1007/978-3-319-19225-3_21 ◽

2015 ◽

pp. 243-255

Author(s):

Gabriela Aslı Rino Nesin ◽

Richard M. Thomas

Keyword(s):

Word Problem ◽

Download Full-text