Lecture Notes in Computer Science - Automata Implementation
Latest Publications

TOTAL DOCUMENTS

22

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540666523, 9783540480570

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Syntactic Prediction with Token Automata: Application to HandiAS System

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_9 ◽

1999 ◽

pp. 100-109 ◽

Author(s):

Denis Maurel ◽

Brigitte Le Pévédic ◽

Olivier Rousseau

Download Full-text

Operations on DASG

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_7 ◽

1999 ◽

pp. 82-91 ◽

Author(s):

Zdeněk Tronìček

Download Full-text

Paging Automata

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_17 ◽

1999 ◽

pp. 192-198

Author(s):

Ricardo Ueda Karpischek

Download Full-text

Automata and Computational Probabilities

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_14 ◽

1999 ◽

pp. 164-177

Author(s):

Marie-Chantal Beaulieu ◽

Anne Bergeron

Download Full-text

A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_11 ◽

1999 ◽

pp. 121-132 ◽

Author(s):

Bruce W. Watson

Keyword(s):

Incremental Algorithm

Download Full-text

Minimal Cover-Automata for Finite Languages

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_4 ◽

1999 ◽

pp. 43-56 ◽

Author(s):

Cezar Câmpeanu ◽

Nicolae Sântean ◽

Sheng Yu

Keyword(s):

Download Full-text

Autographe: A Graphical Version of Automate

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_21 ◽

1999 ◽

pp. 226-229

Author(s):

Are Uppman ◽

Jean-Marc Champarnaud

Download Full-text

On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_18 ◽

1999 ◽

pp. 199-212

Author(s):

Yuri Velinov

Keyword(s):

Computational Environment

Download Full-text

Using Acceptors as Transducers

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_12 ◽

1999 ◽

pp. 133-148

Author(s):

Matti Nykänen

Download Full-text

Implementing Reversed Alternating Finite Automaton (r-AFA) Operations

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/3-540-48057-9_6 ◽

1999 ◽

pp. 69-81 ◽

Author(s):

Sandra Huerter ◽

Kai Salomaa ◽

Xiuming Wu ◽

Sheng Yu

Keyword(s):

Finite Automaton

Download Full-text