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

9783319049205, 9783319049212

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

(k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization

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

10.1007/978-3-319-04921-2_21 ◽

2014 ◽

pp. 260-272 ◽

Cited By ~ 1

Author(s):

Pascal Caron ◽

Marianne Flouret ◽

Ludovic Mignot

Keyword(s):

Deterministic Structures

Download Full-text

Two Double-Exponential Gaps for Automata with a Limited Pushdown

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

10.1007/978-3-319-04921-2_9 ◽

2014 ◽

pp. 113-125 ◽

Cited By ~ 1

Author(s):

Zuzana Bednárová ◽

Viliam Geffert

Keyword(s):

Double Exponential

Download Full-text

Expressiveness of Dynamic Networks of Timed Petri Nets

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

10.1007/978-3-319-04921-2_42 ◽

2014 ◽

pp. 516-527 ◽

Cited By ~ 2

Author(s):

María Martos-Salgado ◽

Fernando Rosa-Velardo

Keyword(s):

Petri Nets ◽

Dynamic Networks ◽

Timed Petri Nets

Download Full-text

Interprocedural Information Flow Analysis of XML Processors

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

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

2014 ◽

pp. 34-61 ◽

Cited By ~ 1

Author(s):

Helmut Seidl ◽

Máté Kovács

Keyword(s):

Information Flow ◽

Flow Analysis ◽

Information Flow Analysis

Download Full-text

On Computability and Learnability of the Pumping Lemma Function

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

10.1007/978-3-319-04921-2_35 ◽

2014 ◽

pp. 433-440

Author(s):

Dariusz Kalociński

Keyword(s):

Pumping Lemma

Download Full-text

Solving Equations on Words with Morphisms and Antimorphisms

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

10.1007/978-3-319-04921-2_15 ◽

2014 ◽

pp. 186-197 ◽

Cited By ~ 1

Author(s):

Alexandre Blondin Massé ◽

Sébastien Gaboury ◽

Sylvain Hallé ◽

Michaël Larouche

Keyword(s):

Solving Equations

Download Full-text

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

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

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

2014 ◽

pp. 161-172 ◽

Cited By ~ 19

Author(s):

Eike Best ◽

Raymond Devillers

Keyword(s):

Petri Nets ◽

The State ◽

State Spaces ◽

Marked Graph

Download Full-text

Efficient List-Based Computation of the String Subsequence Kernel

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

10.1007/978-3-319-04921-2_11 ◽

2014 ◽

pp. 138-148 ◽

Cited By ~ 2

Author(s):

Slimane Bellaouar ◽

Hadda Cherroun ◽

Djelloul Ziadi

Download Full-text

On SAT Representations of XOR Constraints

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

10.1007/978-3-319-04921-2_33 ◽

2014 ◽

pp. 409-420 ◽

Cited By ~ 5

Author(s):

Matthew Gwynne ◽

Oliver Kullmann

Download Full-text

Reachability Analysis with State-Compatible Automata

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

10.1007/978-3-319-04921-2_28 ◽

2014 ◽

pp. 347-359 ◽

Cited By ~ 3

Author(s):

Bertram Felgenhauer ◽

René Thiemann

Keyword(s):

Reachability Analysis

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

(k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization

Two Double-Exponential Gaps for Automata with a Limited Pushdown

Expressiveness of Dynamic Networks of Timed Petri Nets

Interprocedural Information Flow Analysis of XML Processors

On Computability and Learnability of the Pumping Lemma Function

Solving Equations on Words with Morphisms and Antimorphisms

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

Efficient List-Based Computation of the String Subsequence Kernel

On SAT Representations of XOR Constraints

Reachability Analysis with State-Compatible Automata

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