Language and Automata Theory and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319155784, 9783319155791

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_55 ◽

2015 ◽

pp. 703-715 ◽

Cited By ~ 2

Author(s):

Parvaneh Babari ◽

Manfred Droste

Keyword(s):

Mso Logic

Download Full-text

Learning Conjunctive Grammars and Contextual Binary Feature Grammars

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_49 ◽

2015 ◽

pp. 623-635 ◽

Cited By ~ 3

Author(s):

Ryo Yoshinaka

Keyword(s):

Conjunctive Grammars ◽

Binary Feature

Download Full-text

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_46 ◽

2015 ◽

pp. 587-598 ◽

Cited By ~ 2

Author(s):

Alberto Policriti ◽

Nicola Gigante ◽

Nicola Prezza

Keyword(s):

Linear Time ◽

Space Construction ◽

Burrows Wheeler Transform

Download Full-text

Single-Pass Testing Automata for LTL Model Checking

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_44 ◽

2015 ◽

pp. 563-576

Author(s):

Ala Eddine Ben Salem

Keyword(s):

Model Checking ◽

Single Pass ◽

Ltl Model Checking

Download Full-text

Parameterized Complexity of CTL

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_43 ◽

2015 ◽

pp. 549-560 ◽

Cited By ~ 2

Author(s):

Martin Lück ◽

Arne Meier ◽

Irina Schindler

Keyword(s):

Parameterized Complexity

Download Full-text

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_10 ◽

2015 ◽

pp. 133-144 ◽

Cited By ~ 1

Author(s):

H. K. Dai ◽

Z. Wang

Keyword(s):

Random Walk ◽

Parallel Algorithm

Download Full-text

Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_1 ◽

2015 ◽

pp. 3-24 ◽

Cited By ~ 6

Author(s):

Marco Autili ◽

Paola Inverardi ◽

Filippo Mignosi ◽

Romina Spalazzese ◽

Massimo Tivoli

Keyword(s):

Automated Synthesis ◽

Application Layer

Download Full-text

Recognizable Series on Hypergraphs

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_50 ◽

2015 ◽

pp. 639-651

Author(s):

Raphaël Bailly ◽

François Denis ◽

Guillaume Rabusseau

Download Full-text

Towards More Precise Rewriting Approximations

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_51 ◽

2015 ◽

pp. 652-663 ◽

Cited By ~ 2

Author(s):

Yohan Boichut ◽

Jacques Chabin ◽

Pierre Réty

Download Full-text

Compressed Data Structures for Range Searching

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_45 ◽

2015 ◽

pp. 577-586 ◽

Cited By ~ 1

Author(s):

Philip Bille ◽

Inge Li Gørtz ◽

Søren Vind

Keyword(s):

Data Structures ◽

Range Searching ◽

Compressed Data Structures ◽

Compressed Data

Download Full-text

Language and Automata Theory and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic

Learning Conjunctive Grammars and Contextual Binary Feature Grammars

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform

Single-Pass Testing Automata for LTL Model Checking

Parameterized Complexity of CTL

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk

Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications

Recognizable Series on Hypergraphs

Towards More Precise Rewriting Approximations

Compressed Data Structures for Range Searching

Language and Automata Theory and Applications - Lecture Notes in Computer Science
Latest Publications