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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540763352

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient Computation of Throughput Values of Context-Free Languages

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

10.1007/978-3-540-76336-9_20 ◽

2007 ◽

pp. 203-213 ◽

Cited By ~ 3

Author(s):

Didier Caucal ◽

Jurek Czyzowicz ◽

Wojciech Fraczak ◽

Wojciech Rytter

Keyword(s):

Efficient Computation ◽

Context Free

Download Full-text

The Constrained Longest Common Subsequence Problem for Degenerate Strings

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

10.1007/978-3-540-76336-9_30 ◽

2007 ◽

pp. 309-311 ◽

Cited By ~ 3

Author(s):

Costas Iliopoulos ◽

M. Sohel Rahman ◽

Michal Voráček ◽

Ladislav Vagner

Keyword(s):

Longest Common Subsequence ◽

Longest Common Subsequence Problem ◽

Common Subsequence

Download Full-text

OpenFst: A General and Efficient Weighted Finite-State Transducer Library

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

10.1007/978-3-540-76336-9_3 ◽

2007 ◽

pp. 11-23 ◽

Cited By ~ 167

Author(s):

Cyril Allauzen ◽

Michael Riley ◽

Johan Schalkwyk ◽

Wojciech Skut ◽

Mehryar Mohri

Keyword(s):

Finite State ◽

Finite State Transducer

Download Full-text

A New Method for Compiling Parallel Replacement Rules

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

10.1007/978-3-540-76336-9_34 ◽

2007 ◽

pp. 320-321 ◽

Cited By ~ 1

Author(s):

Anssi Yli-Jyrä ◽

Kimmo Koskenniemi

Keyword(s):

New Method ◽

Parallel Replacement

Download Full-text

Multi-grain Relations

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

10.1007/978-3-540-76336-9_23 ◽

2007 ◽

pp. 243-252 ◽

Cited By ~ 1

Author(s):

François Barthélemy

Download Full-text

Analyzing Ambiguity of Context-Free Grammars

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

10.1007/978-3-540-76336-9_21 ◽

2007 ◽

pp. 214-225 ◽

Cited By ~ 4

Author(s):

Claus Brabrand ◽

Robert Giegerich ◽

Anders Møller

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

On the Suffix Automaton with Mismatches

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

10.1007/978-3-540-76336-9_15 ◽

2007 ◽

pp. 144-156 ◽

Cited By ~ 1

Author(s):

Maxime Crochemore ◽

Chiara Epifanio ◽

Alessandra Gabriele ◽

Filippo Mignosi

Keyword(s):

Suffix Automaton

Download Full-text

Efficiently Matching with Local Grammars Using Prefix Overlay Transducers

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

10.1007/978-3-540-76336-9_32 ◽

2007 ◽

pp. 314-316

Author(s):

Clemens Marschner

Download Full-text

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

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

10.1007/978-3-540-76336-9_25 ◽

2007 ◽

pp. 265-276 ◽

Cited By ~ 3

Author(s):

Magnus Steinby ◽

Cătălin Ionuţ Tîrnăucă

Download Full-text

Linear-Time Model Checking: Automata Theory in Practice

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

10.1007/978-3-540-76336-9_2 ◽

2007 ◽

pp. 5-10

Author(s):

Moshe Y. Vardi

Keyword(s):

Model Checking ◽

Linear Time ◽

Automata Theory ◽

Time Model

Download Full-text

Implementation and Application of Automata - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Efficient Computation of Throughput Values of Context-Free Languages

The Constrained Longest Common Subsequence Problem for Degenerate Strings

OpenFst: A General and Efficient Weighted Finite-State Transducer Library

A New Method for Compiling Parallel Replacement Rules

Multi-grain Relations

Analyzing Ambiguity of Context-Free Grammars

On the Suffix Automaton with Mismatches

Efficiently Matching with Local Grammars Using Prefix Overlay Transducers

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

Linear-Time Model Checking: Automata Theory in Practice

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