Narrow your search

Library

KU Leuven (11)

ULiège (9)

Odisee (8)

Thomas More Kempen (8)

Thomas More Mechelen (8)

UCLL (8)

VIVES (8)

UGent (7)

ULB (6)

VUB (5)

More...

Resource type

book (13)


Language

English (13)


Year
From To Submit

2021 (1)

2019 (1)

2017 (1)

2014 (1)

2008 (1)

More...
Listing 1 - 10 of 13 << page
of 2
>>
Sort by
Algebraic combinatorics on words
Author:
ISBN: 1139885685 1107103975 1107089557 110710145X 1107095875 110732601X 9781107089556 9781107326019 9781107095878 0521812208 9780521812207 9781139885683 9781107103979 9780521180719 0521180716 Year: 2002 Volume: v. 90 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

Applied combinatorics on words
Author:
ISBN: 9781107341005 9780521848022 9781461938316 1461938317 1107341000 9781107387492 1107387493 9781107390416 1107390419 0521848024 1139883224 1107383986 110729956X 1107398827 1107395216 Year: 2005 Volume: v. 105 Publisher: Cambridge, UK New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology and linguistics.

Word problems : research and curriculum reform
Author:
ISBN: 0805826610 9780805826616 9781410604484 9781135684297 9781135684334 9781135684341 9780805826609 Year: 1999 Publisher: Mahwah (N.J.): Erlbaum, Lawrence, Associates,

Making sense of word problems
Authors: --- ---
ISBN: 9026516282 9789026516283 Year: 2000 Publisher: Lisse [Netherlands]: Swets & Zeitlinger,


Book
Discovering patterns in mathematics and poetry
Authors: ---
ISBN: 9401205612 1435633105 9781435633100 9789401205610 9042023708 9789042023703 9042023708 9789042023703 Year: 2008 Publisher: Amsterdam New York Rodopi

Loading...
Export citation

Choose an application

Bookmark

Abstract

You are invited to join a fascinating journey of discovery, as Marcia Birken and Anne C. Coon explore the intersecting patterns of mathematics and poetry — bringing the two fields together in a new way. Setting the tone with humor and illustrating each chapter with countless examples, Birken and Coon begin with patterns we can see, hear, and feel and then move to more complex patterns. Number systems and nursery rhymes lead to the Golden Mean and sestinas. Simple patterns of shape introduce tessellations and concrete poetry. Fractal geometry makes fractal poetry possible. Ultimately, patterns for the mind lead to questions: How do mathematicians and poets conceive of proof, paradox, and infinity? What role does analogy play in mathematical discovery and poetic expression? The book will be of special interest to readers who enjoy looking for connections across traditional disciplinary boundaries. Discovering Patterns in Mathematics and Poetry features centuries of creative work by mathematicians, poets, and artists, including Fibonacci, Albrecht Dürer, M. C. Escher, David Hilbert, Benoit Mandelbrot, William Shakespeare, Edna St. Vincent Millay, Langston Hughes, E.E. Cummings, and many contemporary experimental poets. Original illustrations include digital photographs, mathematical and poetic models, and fractal imagery.


Book
The compressed word problem for groups
Author:
ISBN: 1493907484 1493907476 Year: 2014 Publisher: New York, NY : Springer New York : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent results on the compressed word problem to create a cohesive self-contained book accessible to computer scientists as well as mathematicians. Readers will quickly reach the frontier of current research which makes the book especially appealing for students looking for a currently active research topic at the intersection of group theory and computer science. The word problem introduced in 1910 by Max Dehn is one of the most important decision problems in group theory. For many groups, highly efficient algorithms for the word problem exist. In recent years, a new technique based on data compression for providing more efficient algorithms for word problems, has been developed, by representing long words over group generators in a compressed form using a straight-line program. Algorithmic techniques used for manipulating compressed words has shown that the compressed word problem can be solved in polynomial time for a large class of groups such as free groups, graph groups and nilpotent groups. These results have important implications for algorithmic questions related to automorphism groups.

Schemas in problem solving
Author:
ISBN: 0511527896 0521430720 0521043697 Year: 1995 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Schemas in Problem Solving explores a theory of schema development and studies the applicability of the theory as a unified basis for understanding learning, instruction and assessment. The theory's prescriptions for teaching are direct, and its application to assessment suggests new directions for tests. After examining the roots of the theory in earlier work by philosophers and psychologists, Marshall illustrates the main features of her theory with experimental evidence from students who are learning to recognize and solve arithmetic story problems. She describes individual performance with traditional empirical studies as well as computer simulation. The computer simulation reflects an approach in modelling cognition. Marshall's model links neural networks with symbolic systems to form a hybrid model that uses pattern matching of sets of features as well as logical step-by-step rules.

The Geometry of the Word Problem for Finitely Generated Groups
Authors: --- ---
ISBN: 3764379502 9783764379490 3764379499 9783764379506 Year: 2007 Publisher: Basel : Birkhäuser Basel : Imprint: Birkhäuser,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The advanced course on The geometry of the word problem for ?nitely presented groups was held July 5-15, 2005, at the Centre de Recerca Matematica ` in B- laterra (Barcelona). It was aimed at young researchersand recent graduates int- ested in geometricapproachesto grouptheory,in particular,to the wordproblem. Three eight-hour lecture series were delivered and are the origin of these notes. There were also problem sessions and eight contributed talks. The course was the closing activity of a research program on The geometry of the word problem, held during the academic year 2004-05 and coordinated by Jos´ eBurilloandEnricVenturafromtheUniversitatPolit` ecnicadeCatalunya,and Noel Brady,fromOklahoma University. Thirty-?vescientists participated in these events, in visits to the CRM of between one week and the whole year. Two weekly seminars and countless informal meetings contributed to a dynamic atmosphere of research. The authors of these notes would like to express their gratitude to the m- velous sta? at the CRM, director Manuel Castellet and all the secretaries, for providing great facilities and a very pleasant working environment. Also, the - thors thank Jos´ e Burillo and Enric Ventura for organising the research year, for ensuring its smooth running, and for the invitations to give lecture series. - nally, thanks are due to all those who attended the courses for their interest, their questions, and their enthusiasm.

Listing 1 - 10 of 13 << page
of 2
>>
Sort by