Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 25-29, 1987, Proceedings - researchr publication

researchr

You are not signed in
Sign in
Sign up

Jean-Eric Pin, editor, Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 25-29, 1987, Proceedings. Volume 386 of Lecture Notes in Computer Science, Springer, 1989.

Conference: litp1989

Abstract is missing.

Finite automata and rational languages. An introductionJean Berstel. 2-14

The wreath product and its applicationsHoward Straubing. 15-24

Décomposition polynomiale des fonctions rationnelles (English summary)Marcel Paul Schützenberger. 25-33

Relational morphisms, transductions and operations on languagesJean-Eric Pin. 34-55

Basic techniques for two-way finite automataJean-Camille Birget. 56-64

Properties of factorization forestsImre Simon. 65-72

Relative star height, star height and finite automata with distance functionsKosaburo Hashiguchi. 74-88

Automata and the word problemJohn C. Meakin. 89-103

Automata and quantifier hierarchiesWolfgang Thomas. 104-119

Concatenation product: a surveyPascal Weil. 120-137

A finiteness condition for semigroupsAldo de Luca, Stefano Varricchio. 138-147

Equations for pseudovarietiesJorge Almeida. 148-164

Algorithms and automataMaxime Crochemore. 166-175

Numbers and automataG. Rauzy. 176-185

Codes and AutomataAntonio Restivo. 186-198

Finite automata and computational complexityHoward Straubing, Denis Thérien. 199-233

A characterization of fair computations of finite state SCCS processesIrène Guessarian. 234-248

Verification of distributed systems: an experimentDidier Vergamini. 249-259

runs on WebDSL