Lecture Notes in Computer Science - Automata Implementation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540646945, 9783540691044

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

INTEX: An integrated FST toolbox

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031392 ◽

1998 ◽

pp. 185-197 ◽

Cited By ~ 3

Author(s):

Max Silberztein

Download Full-text

Teaching theory of computation with tape machines

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031394 ◽

1998 ◽

pp. 213-227 ◽

Cited By ~ 1

Author(s):

Y. Velinov

Keyword(s):

Theory Of Computation

Download Full-text

Automata of asynchronous behaviors

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031379 ◽

1998 ◽

pp. 29-45

Author(s):

J. A. Brzozowski ◽

R. Negulescu

Download Full-text

Sorting and doubling techniques for set partitioning and automata minimization problems

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031397 ◽

1998 ◽

pp. 241-251

Author(s):

D. Ziadi

Keyword(s):

Set Partitioning ◽

Minimization Problems

Download Full-text

Construction of efficient generalized LR parsers

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031377 ◽

1998 ◽

pp. 7-24 ◽

Cited By ~ 3

Author(s):

Miguel A. Alonso ◽

David Cabrero ◽

Manuel Vilares

Keyword(s):

Lr Parsers

Download Full-text

An efficient null-free procedure for deciding regular language membership

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031389 ◽

1998 ◽

pp. 159-170 ◽

Cited By ~ 1

Author(s):

J. -L. Ponty

Keyword(s):

Regular Language ◽

Language Membership

Download Full-text

Tools to implement automata, a first step: ASTL

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031384 ◽

1998 ◽

pp. 104-108 ◽

Cited By ~ 3

Author(s):

Vincent Le Maout

Download Full-text

Minimal separating sets for Muller automata

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031385 ◽

1998 ◽

pp. 109-121

Author(s):

Helmut Lescow ◽

Jens Vöge

Download Full-text

Multi-tape automata for speech and language systems: A prolog implementation

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031383 ◽

1998 ◽

pp. 87-103 ◽

Cited By ~ 4

Author(s):

George Anton Kiraz ◽

Edmund Grimley-Evans

Keyword(s):

Speech And Language

Download Full-text

Efficient implementation of regular languages using r-AFA

Lecture Notes in Computer Science - Automata Implementation ◽

10.1007/bfb0031391 ◽

1998 ◽

pp. 176-184 ◽

Cited By ~ 3

Author(s):

K. Salomaa ◽

X. Wu ◽

S. Yu

Keyword(s):

Efficient Implementation ◽

Regular Languages

Download Full-text

Lecture Notes in Computer Science - Automata ImplementationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

INTEX: An integrated FST toolbox

Teaching theory of computation with tape machines

Automata of asynchronous behaviors

Sorting and doubling techniques for set partitioning and automata minimization problems

Construction of efficient generalized LR parsers

An efficient null-free procedure for deciding regular language membership

Tools to implement automata, a first step: ASTL

Minimal separating sets for Muller automata

Multi-tape automata for speech and language systems: A prolog implementation

Efficient implementation of regular languages using r-AFA

Lecture Notes in Computer Science - Automata Implementation
Latest Publications