This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998. The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions based on 160 referees' reports. The papers are organized in sections on algorithms and complexity; automata, transition systems and combinatorics on words; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing.

Syntax, Bruce McMenomy would like the beleaguered student to know, is not a collection of inconsistent and arbitrary rules, but rather an organic expression of meaning that evolved over time. Aimed at intermediate and advanced students of classical languages, this book shows how understanding grammatical concepts as channels for meaning makes learning them that much easier and, in a word, natural. Syntactical Mechanics systematically defines the basic categories of traditional grammar (parts of speech, subjects and predicates, and types of sentences and subordinate clauses), and then unpacks the most important syntactical structures and markings that shape meaning in a sentence. These grammatical entities evolved, McMenomy asserts, from their common Indo-European ancestors as tools for the expression of meaning, and the continuity of an idea can often be traced through these structures. Accordingly, he examines the elements of English, Latin, and Greek syntax together, exploring how their similarities and differences can disclose something of their underlying rationale. With abundant examples from English as well as Latin and Greek, McMenomy considers the grammatical cases of the noun, and the tenses, moods, and aspects of a verb. In an engaging and accessible manner, McMenomy helps to rationalize the apparent inconsistencies between Latin and Greek and makes the mastery of Latin and Greek constructions that much more meaningful, reasonable, and likely.

Bibliographical record of works published by members of the Association, in v. 28- 1897-

Gavin Hardy and Laurence Totelin have brought together their botanical and historical knowledge to produce this unique overview of ancient botany. It examines all the founding texts of botanical science, such as Theophrastus' Enquiry into Plants, Dioscorides' Materia Medica, Pliny the Elder's Natural History, Nicolaus of Damascus' On Plants, and Galen' On Simple Remedies, but also includes lesser known texts ranging from the sixth century BCE to the seventh century CE, as well as some material evidence. The authors adopt a thematic approach rather than a chronological one, considering important issues such as the definition of a plant, nomenclature, classifications, physiology, the link between plants and their environment, and the numerous usages of plants in the ancient world. The book also takes care to place ancient botany in its historical, social and economic context. The authors have explained all technical botanical terms and ancient history notions, and as a result, this work will appeal to historians of ancient science, medicine and technology; classicists; and botanists interested in the history of their discipline.

Care & Conservation of Manuscripts 2 - Proceedings of the Second International Seminar Held at the University of Copenhagen 16-17 October 1995

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. Serves as both an introduction to the field and as a reference book. Contains numerous exercises desgined to aid students and readers. Self-contained chapters provide helpful guidance for lectures.

This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

The first study to focus on the numerous ancient Greek fables occurring outside (and predating) the extant fable collections. Divided into three parts, its core is an intertextual analysis of the functions of fables and their allusions. Here the author covers many different authors and a variety of genres in Archaic, Classical and Hellenistic Greek Literature, ranging from lyric to historiography, from Aristotle to Hesiod and from Agamemnon to Zopyrus. This analysis is based on a study of both modern and ancient fable theory - the latter having hitherto never been studied in toto, and incorporating the Graeco-Roman terminology of the genre. The book's third part is a collection of all texts (and contexts) studied, which greatly facilitates cross-referencing.