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

TOTAL DOCUMENTS

26

(FIVE YEARS 26)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer International Publishing

9783030681944, 9783030681951

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Location Based Automata for Expressions with Shuffle

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

10.1007/978-3-030-68195-1_4 ◽

2021 ◽

pp. 43-54

Author(s):

Sabine Broda ◽

António Machiavelo ◽

Nelma Moreira ◽

Rogério Reis

Download Full-text

Tree-Like Unit Refutations in Horn Constraint Systems

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

10.1007/978-3-030-68195-1_18 ◽

2021 ◽

pp. 226-237

Author(s):

K. Subramani ◽

Piotr Wojciechowski

Keyword(s):

Constraint Systems

Download Full-text

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs

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

10.1007/978-3-030-68195-1_22 ◽

2021 ◽

pp. 279-290

Author(s):

Bastien Sérée ◽

Loïg Jezequel ◽

Didier Lime

Keyword(s):

Shortest Paths ◽

Weighted Graphs ◽

Download Full-text

Cadences in Grammar-Compressed Strings

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

10.1007/978-3-030-68195-1_26 ◽

2021 ◽

pp. 331-342

Author(s):

Julian Pape-Lange

Download Full-text

Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding

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

10.1007/978-3-030-68195-1_19 ◽

2021 ◽

pp. 241-254

Author(s):

Stefano Crespi Reghizzi ◽

Pierluigi San Pietro

Keyword(s):

Download Full-text

On Language Varieties Without Boolean Operations

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

10.1007/978-3-030-68195-1_1 ◽

2021 ◽

pp. 3-15

Author(s):

Fabian Birkmann ◽

Stefan Milius ◽

Henning Urbat

Keyword(s):

Boolean Operations ◽

Language Varieties

Download Full-text

Context-Free Grammars with Lookahead

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

10.1007/978-3-030-68195-1_16 ◽

2021 ◽

pp. 213-225

Author(s):

Takayuki Miyazaki ◽

Yasuhiko Minamide

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

Partially Directed Animals with a Bounded Number of Holes

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

10.1007/978-3-030-68195-1_2 ◽

2021 ◽

pp. 16-28

Author(s):

Valentina Dorigatti ◽

Paolo Massazza

Keyword(s):

Download Full-text

Commutative Rational Term Rewriting

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

10.1007/978-3-030-68195-1_15 ◽

2021 ◽

pp. 200-212

Author(s):

Mamoru Ishizuka ◽

Takahito Aoto ◽

Munehiro Iwami

Keyword(s):

Term Rewriting ◽

Download Full-text

On Hardest Languages for One-Dimensional Cellular Automata

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

10.1007/978-3-030-68195-1_10 ◽

2021 ◽

pp. 118-130

Author(s):

Mikhail Mrykhin ◽

Alexander Okhotin

Keyword(s):

Cellular Automata ◽

One Dimensional

Download Full-text