• Aucun résultat trouvé

Infinite Words, Volume 141

N/A
N/A
Protected

Academic year: 2022

Partager "Infinite Words, Volume 141"

Copied!
2
0
0

Texte intégral

(1)

Year 2003 Hardbound

ISBN: 0-12-532111-2 450 pages

£74.00 / USD 111.00

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science.

Infinite Words is the first manual devoted to this topic.

Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger.

Infinite Words, Volume 141

Automata, Semigroups, Logic and Games

Further information, full contents and ordering details available online at:

www.elsevier.com/locate/isbn/0125321112

ANNOUNCING

Key Features:

The very first comprehensive treatment of the theory of Infinite Words, this book is 'the' reference text for researchers and graduates in this field By

Dominique Perrin, Université de Marne la vallée, France Jean-Éric Pin, CNRS, Paris, France

Pure and Applied Mathematics

KEY FEATURES:

• Serves as both an introduction to the field and as a reference book.

• Contains numerous exercises designed to aid students and readers.

• Self-contained chapters provide helpful guidance for

lectures.

(2)

YES! Please send me _____ copy(ies) of Infinite Words, Volume 141

ISBN: 0-12-532111-2 . Price: £74.00 / USD 111.00

Order value sub-total EUR/USD______________

Non-UK EU (European Union) residents must either: state VAT number here _______________________ or add VAT (or your country’s equivalent)

@_______________%

Total payment EUR/USD ___________

EUR (euro) prices apply to customers in Europe and Japan. USD prices apply to customers in all other countries.

Name (Please Print) Position

Organization Address Region/State

Post/Zip Code Country

Tel Fax

E-mail/Internet No.

Payment Details

❏ Please send a pro forma invoice.

❏ Cheque/money order/UNESCO coupon made payable to Elsevier enclosed.

❏ I wish to pay by credit card. Your credit card will be debited including VAT when applicable.

❏ VISA ❏ American Express ❏ MasterCard

Card No. Exp. Date

Signature Date

❏ If you wish to receive information regarding our other publications, please tick this box.

❏ If you wish to receive information from other companies or third parties, please tick this box.

A Reminder to Contributors ...

A 30% Discount is available to all Elsevier book and journal contributors on all books except multi-volume reference works. To claim your discount full payment is required with your order which must be sent directly to the publisher.

Save Postage and Handling Charges

If you send full payment with your order, we will pay postage.

BOOK ORDER FORM

4 EASY WAYS TO ORDER Phone • Fax • Mail • E-mail

For fastest service, complete the order form and return it to the Elsevier Office nearest you.

ELSEVIER OFFICES

For customers in the Americas:

Elsevier

Customer Service Department 11830 Westline Industrial Drive St. Louis, MO 63146, USA for US customers

Tel: (+1) 800 545 2522 Fax: (+1) 800 535 9935 for customers outside US Tel: (+1) 800 460 3110 Fax: (+1) 314 453 7095

E-mail: [email protected]

For customers in Japan:

Elsevier Regional Sales Office Customer Service Department 9-15 Higashi-Azabu

1-chome, BLDG 2F, Minato-ku Tokyo, 106-0044 Japan

Tel: (+81) 3589 6370 Fax: (+81) 3589 6371 E-mail: [email protected]

For customers in the Far East:

Elsevier Regional Sales Office 3 Killiney Road

#08-01, Winsland House 1 Singapore 239519

Tel: (+65) 6349-0222 Fax: (+65) 6733-1510

E-mail: [email protected]

For customers in Australia and New Zealand:

Elsevier Australia 30-52 Smidmore Street Marrickville, NSW 2204 Australia

Tel: (+61) 2 9517 8999 Fax: (+61) 2 9517 2249

E-mail: [email protected]

For customers in other locations:

Elsevier

Book Customer Services Linacre House, Jordan Hill Oxford OX2 8DP, UK for UK customers Tel: 01865 474000 Fax: 01865 474001 For customers outside UK Tel: +44 1865 474110 Fax: +44 1865 474111

Email: [email protected]

Références

Documents relatifs

In [6] a related question has been posed for the k-abelian case: Do there exist infinite words such that each factor contains the maximal number, up to a constant, of

(2006)] about the number of squares in smooth words, we show that the Lyndon factorization of the minimal infinite smooth word is a strictly decreasing sequence of Lyndon words,

Abstract: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory.. We first show

We prove that there exist infinitely many 2-overlap-free binary partial words containing an infinite number of holes.. © 2009

In this article we show that we can combine the two types of constraints for the binary alphabet: producing an infinite word whose maximal exponent of its factor is the smallest

If w is an infinite 7/3-power-free binary word, then there is a position i such that w does not contain arbitrarily large squares beginning at posi- tion

unique palindromic extension of p. Let us recall that if w is a left special factor of length n + 1, then its prefix of length n is necessarily left special, too. By reversal

As a first result in this direction, we have shown in [10] that the complexity functions of a large class of words over finite alphabets, generated by complete, deterministic