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 Berlin Heidelberg

9783642225994, 9783642226007

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages

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

10.1007/978-3-642-22600-7_8 ◽

2011 ◽

pp. 93-106 ◽

Cited By ~ 1

Author(s):

Janusz Brzozowski ◽

Baiyu Li ◽

Yuli Ye

Keyword(s):

Regular Languages ◽

Syntactic Complexity

Download Full-text

The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata

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

10.1007/978-3-642-22600-7_7 ◽

2011 ◽

pp. 80-92 ◽

Cited By ~ 2

Author(s):

Zuzana Bednárová ◽

Viliam Geffert ◽

Carlo Mereghetti ◽

Beatrice Palano

Keyword(s):

Boolean Operations ◽

Constant Height ◽

Pushdown Automata

Download Full-text

Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences

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

10.1007/978-3-642-22600-7_25 ◽

2011 ◽

pp. 314-327

Author(s):

Jiří Wiedermann

Download Full-text

State Trade-Offs in Unranked Tree Automata

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

10.1007/978-3-642-22600-7_21 ◽

2011 ◽

pp. 261-274 ◽

Cited By ~ 4

Author(s):

Xiaoxue Piao ◽

Kai Salomaa

Keyword(s):

Tree Automata ◽

Trade Offs

Download Full-text

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet

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

10.1007/978-3-642-22600-7_18 ◽

2011 ◽

pp. 222-234 ◽

Cited By ~ 1

Author(s):

Michal Kunc ◽

Alexander Okhotin

Keyword(s):

Finite Automata ◽

Deterministic Finite Automata ◽

State Complexity

Download Full-text

State Complexity of Projected Languages

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

10.1007/978-3-642-22600-7_16 ◽

2011 ◽

pp. 198-211 ◽

Cited By ~ 4

Author(s):

Galina Jirásková ◽

Tomáš Masopust

Keyword(s):

State Complexity

Download Full-text

State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal

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

10.1007/978-3-642-22600-7_13 ◽

2011 ◽

pp. 158-171 ◽

Cited By ~ 3

Author(s):

Yuan Gao ◽

Sheng Yu

Keyword(s):

State Complexity ◽

Combined Operations

Download Full-text

Construction and SAT-Based Verification of Contextual Unfoldings

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

10.1007/978-3-642-22600-7_3 ◽

2011 ◽

pp. 34-42 ◽

Cited By ~ 1

Author(s):

Stefan Schwoon ◽

César Rodríguez

Download Full-text

Geometrical Regular Languages and Linear Diophantine Equations

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

10.1007/978-3-642-22600-7_9 ◽

2011 ◽

pp. 107-120 ◽

Cited By ~ 1

Author(s):

Jean-Marc Champarnaud ◽

Jean-Philippe Dubernard ◽

Franck Guingne ◽

Hadrien Jeanne

Keyword(s):

Diophantine Equations ◽

Regular Languages ◽

Linear Diophantine Equations

Download Full-text

Remarks on Separating Words

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

10.1007/978-3-642-22600-7_12 ◽

2011 ◽

pp. 147-157 ◽

Cited By ~ 4

Author(s):

Erik D. Demaine ◽

Sarah Eisenstat ◽

Jeffrey Shallit ◽

David A. Wilson

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages

The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata

Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences

State Trade-Offs in Unranked Tree Automata

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet

State Complexity of Projected Languages

State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal

Construction and SAT-Based Verification of Contextual Unfoldings

Geometrical Regular Languages and Linear Diophantine Equations

Remarks on Separating Words

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