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

TOTAL DOCUMENTS

19

(FIVE YEARS 19)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer International Publishing

9783030625351, 9783030625368

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Power of Generalized Forbidding Insertion-Deletion Systems

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

10.1007/978-3-030-62536-8_5 ◽

2020 ◽

pp. 52-63

Author(s):

Henning Fernau ◽

Lakshmanan Kuppusamy ◽

Indhumathi Raman

Download Full-text

Bad Pictures: Some Structural Properties Related to Overlaps

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

10.1007/978-3-030-62536-8_2 ◽

2020 ◽

pp. 13-25

Author(s):

Marcella Anselmo ◽

Dora Giammarresi ◽

Maria Madonia ◽

Carla Selmi

Keyword(s):

Structural Properties

Download Full-text

Mutually Accepting Capacitated Automata

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

10.1007/978-3-030-62536-8_1 ◽

2020 ◽

pp. 1-12

Author(s):

Ravid Alon ◽

Orna Kupferman

Download Full-text

Longer Shortest Strings in Two-Way Finite Automata

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

10.1007/978-3-030-62536-8_9 ◽

2020 ◽

pp. 104-116

Author(s):

Stanislav Krymski ◽

Alexander Okhotin

Keyword(s):

Finite Automata

Download Full-text

Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata

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

10.1007/978-3-030-62536-8_8 ◽

2020 ◽

pp. 91-103

Author(s):

Chris Keeler ◽

Kai Salomaa

Keyword(s):

Finite Automata

Download Full-text

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

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

10.1007/978-3-030-62536-8_4 ◽

2020 ◽

pp. 39-51

Author(s):

Manfred Droste ◽

Zoltán Fülöp ◽

Dávid Kószó ◽

Heiko Vogler

Keyword(s):

Tree Automata ◽

Weighted Tree ◽

Locally Finite ◽

Weighted Tree Automata

Download Full-text

Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata

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

10.1007/978-3-030-62536-8_17 ◽

2020 ◽

pp. 206-218

Author(s):

Taylor J. Smith ◽

Kai Salomaa

Keyword(s):

Two Dimensional ◽

Complexity Results

Download Full-text

On the Generative Power of Quasiperiods

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

10.1007/978-3-030-62536-8_18 ◽

2020 ◽

pp. 219-230

Author(s):

Ludwig Staiger

Keyword(s):

Generative Power

Download Full-text

Regular Expression Length via Arithmetic Formula Complexity

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

10.1007/978-3-030-62536-8_3 ◽

2020 ◽

pp. 26-38

Author(s):

Ehud Cseresnyes ◽

Hannes Seiwert

Keyword(s):

Regular Expression ◽

Formula Complexity

Download Full-text

State Complexity Bounds for the Commutative Closure of Group Languages

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

10.1007/978-3-030-62536-8_6 ◽

2020 ◽

pp. 64-77

Author(s):

Stefan Hoffmann

Keyword(s):

Complexity Bounds ◽

State Complexity

Download Full-text