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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030232467, 9783030232474

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

NFA-to-DFA Trade-Off for Regular Operations

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

10.1007/978-3-030-23247-4_14 ◽

2019 ◽

pp. 184-196 ◽

Cited By ~ 1

Author(s):

Galina Jirásková ◽

Ivana Krajňáková

Keyword(s):

Trade Off

Download Full-text

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity

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

10.1007/978-3-030-23247-4_12 ◽

2019 ◽

pp. 158-170

Author(s):

Yo-Sub Han ◽

Sang-Ki Ko ◽

Kai Salomaa

Keyword(s):

Decidability And Complexity ◽

Pushdown Automata ◽

Limited Nondeterminism

Download Full-text

Descriptional Complexity of Matrix Simple Semi-conditional Grammars

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

10.1007/978-3-030-23247-4_8 ◽

2019 ◽

pp. 111-123 ◽

Cited By ~ 1

Author(s):

Henning Fernau ◽

Lakshmanan Kuppusamy ◽

Indhumathi Raman

Keyword(s):

Descriptional Complexity

Download Full-text

Limited Automata: Properties, Complexity and Variants

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

10.1007/978-3-030-23247-4_4 ◽

2019 ◽

pp. 57-73

Author(s):

Giovanni Pighizzini

Download Full-text

Generalized de Bruijn Words and the State Complexity of Conjugate Sets

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

10.1007/978-3-030-23247-4_10 ◽

2019 ◽

pp. 137-146

Author(s):

Daniel Gabric ◽

Štěpán Holub ◽

Jeffrey Shallit

Keyword(s):

The State ◽

State Complexity ◽

De Bruijn

Download Full-text

Square, Power, Positive Closure, and Complementation on Star-Free Languages

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

10.1007/978-3-030-23247-4_7 ◽

2019 ◽

pp. 98-110

Author(s):

Sylvie Davies ◽

Michal Hospodár

Download Full-text

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)

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

10.1007/978-3-030-23247-4_5 ◽

2019 ◽

pp. 74-85

Author(s):

Simon Beier ◽

Markus Holzer

Keyword(s):

Finite Automata

Download Full-text

On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances

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

10.1007/978-3-030-23247-4_21 ◽

2019 ◽

pp. 272-284

Author(s):

Petra Wolf

Download Full-text

On Classes of Regular Languages Related to Monotone WQOs

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

10.1007/978-3-030-23247-4_18 ◽

2019 ◽

pp. 235-247

Author(s):

Mizuhito Ogawa ◽

Victor Selivanov

Keyword(s):

Regular Languages

Download Full-text

State Complexity of Simple Splicing

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

10.1007/978-3-030-23247-4_15 ◽

2019 ◽

pp. 197-209

Author(s):

Lila Kari ◽

Timothy Ng

Keyword(s):

State Complexity

Download Full-text

Descriptional Complexity of Formal Systems - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

NFA-to-DFA Trade-Off for Regular Operations

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity

Descriptional Complexity of Matrix Simple Semi-conditional Grammars

Limited Automata: Properties, Complexity and Variants

Generalized de Bruijn Words and the State Complexity of Conjugate Sets

Square, Power, Positive Closure, and Complementation on Star-Free Languages

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)

On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances

On Classes of Regular Languages Related to Monotone WQOs

State Complexity of Simple Splicing

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