Formal Properties of Finite Automata and Applications (Record no. 35169)

000 -LEADER
fixed length control field 03336nam a22004935i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540467212
-- 978-3-540-46721-2
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
245 10 - TITLE STATEMENT
Title Formal Properties of Finite Automata and Applications
Sub Title LITP Spring School on Theoretical Computer Science Ramatuelle, France, May 23–27, 1988 Proceedings /
Statement of responsibility, etc edited by J. E. Pin.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1989.
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 266 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Pin, J. E.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0013106
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1989.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK5875 http://dx.doi.org/10.1007/BFb0013106 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha