Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /

The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.

Saved in:
Bibliographic Details
Main Authors: Pin, J. E. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 1989
Subjects:Mathematics., Computers., Mathematical logic., Combinatorics., Mathematical Logic and Foundations., Mathematical Logic and Formal Languages., Computation by Abstract Devices.,
Online Access:http://dx.doi.org/10.1007/BFb0013106
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:175640
record_format koha
spelling KOHA-OAI-TEST:1756402018-07-30T22:54:09ZFormal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings / Pin, J. E. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1989.engThe volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.Finite automata and rational languages an introduction -- The wreath product and its applications -- Polynomial decomposition of rational functions / Decomposition polynomiale des fonctions rationnelles -- Relational morphisms, transductions and operations on languages -- Basic techniques for two-way finite automata -- Properties of factorization forests -- Relative star height, star height and finite automata with distance functions -- Automata and the word problem -- Automata and quantifier hierarchies -- Concatenation product: a survey -- A finiteness condition for semigroups -- Equations for pseudovarieties -- Algorithms and automata -- Numbers and automata -- Codes and automata -- Finite automata and computational complexity -- A characterization of fair computations of finite state SCCS processes -- Verification of distributed systems: An experiment.The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.Mathematics.Computers.Mathematical logic.Combinatorics.Mathematics.Mathematical Logic and Foundations.Mathematical Logic and Formal Languages.Computation by Abstract Devices.Combinatorics.Springer eBookshttp://dx.doi.org/10.1007/BFb0013106URN:ISBN:9783540467212
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Mathematics.
Computers.
Mathematical logic.
Combinatorics.
Mathematics.
Mathematical Logic and Foundations.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Combinatorics.
Mathematics.
Computers.
Mathematical logic.
Combinatorics.
Mathematics.
Mathematical Logic and Foundations.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Combinatorics.
spellingShingle Mathematics.
Computers.
Mathematical logic.
Combinatorics.
Mathematics.
Mathematical Logic and Foundations.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Combinatorics.
Mathematics.
Computers.
Mathematical logic.
Combinatorics.
Mathematics.
Mathematical Logic and Foundations.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Combinatorics.
Pin, J. E. editor.
SpringerLink (Online service)
Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
description The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.
format Texto
topic_facet Mathematics.
Computers.
Mathematical logic.
Combinatorics.
Mathematics.
Mathematical Logic and Foundations.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Combinatorics.
author Pin, J. E. editor.
SpringerLink (Online service)
author_facet Pin, J. E. editor.
SpringerLink (Online service)
author_sort Pin, J. E. editor.
title Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
title_short Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
title_full Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
title_fullStr Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
title_full_unstemmed Formal Properties of Finite Automata and Applications [electronic resource] : LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
title_sort formal properties of finite automata and applications [electronic resource] : litp spring school on theoretical computer science ramatuelle, france, may 23–27, 1988 proceedings /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg,
publishDate 1989
url http://dx.doi.org/10.1007/BFb0013106
work_keys_str_mv AT pinjeeditor formalpropertiesoffiniteautomataandapplicationselectronicresourcelitpspringschoolontheoreticalcomputerscienceramatuellefrancemay23271988proceedings
AT springerlinkonlineservice formalpropertiesoffiniteautomataandapplicationselectronicresourcelitpspringschoolontheoreticalcomputerscienceramatuellefrancemay23271988proceedings
_version_ 1756264028163801088