Formal Languages, Automata and Numeration Systems

Formal Languages, Automata and Numeration Systems - Networks and Telecommunications Series

Hardback (04 Nov 2014)

Save $0.39

  • RRP $178.58
  • $178.19
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within two working days

Publisher's Synopsis

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory).

Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns.  When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory.

Book information

ISBN: 9781848216150
Publisher: Wiley
Imprint: Wiley-ISTE
Pub date:
DEWEY: 005.131
DEWEY edition: 23
Language: English
Number of pages: 338
Weight: 635g
Height: 243mm
Width: 164mm
Spine width: 25mm