000 03336nam a22004935i 4500
001 978-3-540-46721-2
003 DE-He213
005 20160624102017.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540467212
_9978-3-540-46721-2
024 7 _a10.1007/BFb0013106
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aFormal Properties of Finite Automata and Applications
_h[electronic resource] :
_bLITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
_cedited by J. E. Pin.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aX, 266 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v386
505 0 _aFinite 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.
520 _aThe 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.
650 0 _aComputer science.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aCombinatorics.
700 1 _aPin, J. E.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540516316
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v386
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0013106
942 _2EBK5875
_cEBK
999 _c35169
_d35169