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

TOTAL DOCUMENTS

9

(FIVE YEARS 9)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer International Publishing

9783030934880, 9783030934897

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Complexity Issues for the Iterated h-Preorders

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

10.1007/978-3-030-93489-7_1 ◽

2021 ◽

pp. 1-12

Author(s):

Pavel Alaev ◽

Victor Selivanov

Download Full-text

State Complexity of Union and Intersection on Graph-Walking Automata

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

10.1007/978-3-030-93489-7_11 ◽

2021 ◽

pp. 125-136

Author(s):

Olga Martynova ◽

Alexander Okhotin

Keyword(s):

State Complexity

Download Full-text

More on the Descriptional Complexity of Products of Finite Automata

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

10.1007/978-3-030-93489-7_7 ◽

2021 ◽

pp. 76-87

Author(s):

Markus Holzer ◽

Christian Rauch

Keyword(s):

Finite Automata ◽

Descriptional Complexity

Download Full-text

State Complexity Investigations on Commutative Languages – the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages

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

10.1007/978-3-030-93489-7_6 ◽

2021 ◽

pp. 64-75

Author(s):

Stefan Hoffmann

Keyword(s):

Commutative Group ◽

State Complexity ◽

Downward Closure

Download Full-text

Image-Binary Automata

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

10.1007/978-3-030-93489-7_15 ◽

2021 ◽

pp. 176-187

Author(s):

Stefan Kiefer ◽

Cas Widdershoven

Download Full-text

Width Measures of Alternating Finite Automata

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

10.1007/978-3-030-93489-7_8 ◽

2021 ◽

pp. 88-99

Author(s):

C. Keeler ◽

Kai Salomaa

Keyword(s):

Finite Automata

Download Full-text

Disambiguation of Weighted Tree Automata

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

10.1007/978-3-030-93489-7_14 ◽

2021 ◽

pp. 163-175

Author(s):

Kevin Stier ◽

Markus Ulbricht

Keyword(s):

Tree Automata ◽

Weighted Tree ◽

Weighted Tree Automata

Download Full-text

Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets

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

10.1007/978-3-030-93489-7_3 ◽

2021 ◽

pp. 26-37

Author(s):

Viliam Geffert ◽

Alexander Okhotin

Keyword(s):

Finite Automata ◽

Deterministic Finite Automata

Download Full-text

Sync-Maximal Permutation Groups Equal Primitive Permutation Groups

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

10.1007/978-3-030-93489-7_4 ◽

2021 ◽

pp. 38-50

Author(s):

Stefan Hoffmann

Keyword(s):

Permutation Groups

Download Full-text