Implementation and Application of Automata - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

17

(FIVE YEARS 0)

H-INDEX

2

(FIVE YEARS 0)

Published By Springer International Publishing

9783319601335, 9783319601342

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Synchronization Problems in Automata Without Non-trivial Cycles

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_16 ◽

2017 ◽

pp. 188-200 ◽

Author(s):

Andrew Ryzhikov

Keyword(s):

Synchronization Problems

Download Full-text

On the Number of Active States in Deterministic and Nondeterministic Finite Automata

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_4 ◽

2017 ◽

pp. 40-51

Author(s):

Henning Bordihn ◽

Markus Holzer

Keyword(s):

Finite Automata ◽

Nondeterministic Finite Automata

Download Full-text

Transducing Reversibly with Finite State Machines

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_13 ◽

2017 ◽

pp. 151-162 ◽

Author(s):

Martin Kutrib ◽

Andreas Malcher ◽

Matthias Wendlandt

Keyword(s):

Finite State Machines ◽

State Machines ◽

Download Full-text

From Hadamard Expressions to Weighted Rotating Automata and Back

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_14 ◽

2017 ◽

pp. 163-174

Author(s):

Louis-Marie Dando ◽

Sylvain Lombardy

Download Full-text

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_8 ◽

2017 ◽

pp. 89-100 ◽

Author(s):

Henning Fernau ◽

Lakshmanan Kuppusamy ◽

Indhumathi Raman

Keyword(s):

Computational Completeness

Download Full-text

Complexity of Bifix-Free Regular Languages

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_7 ◽

2017 ◽

pp. 76-88 ◽

Author(s):

Robert Ferens ◽

Marek Szykuła

Keyword(s):

Regular Languages

Download Full-text

On the Semantics of Atomic Subgroups in Practical Regular Expressions

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_2 ◽

2017 ◽

pp. 14-26 ◽

Author(s):

Martin Berglund ◽

Brink van der Merwe ◽

Bruce Watson ◽

Nicolaas Weideman

Keyword(s):

Regular Expressions

Download Full-text

On the Complexity of Determinizing Monitors

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_1 ◽

2017 ◽

pp. 1-13 ◽

Author(s):

Luca Aceto ◽

Antonis Achilleos ◽

Adrian Francalanza ◽

Anna Ingólfsdóttir ◽

Sævar Örn Kjartansson

Download Full-text

Syntactic Complexity of Bifix-Free Languages

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_17 ◽

2017 ◽

pp. 201-212 ◽

Author(s):

Marek Szykuła ◽

John Wittnebel

Keyword(s):

Syntactic Complexity

Download Full-text

On the Regularity and Learnability of Ordered DAG Languages

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-60134-2_3 ◽

2017 ◽

pp. 27-39 ◽

Author(s):

Henrik Björklund ◽

Johanna Björklund ◽

Petter Ericson

Download Full-text