A Structural Theory for Varieties of Tree Languages

Author: Saeed Salehi

Publisher: VDM Verlag Dr. Muller

ISBN: 3639230558


Page: 164

View: 1969

Trees are among the most fundamental and ubiquitous structures in mathematics and computer science. The notion of "tree" appears in many seemingly different areas from graph theory to universal algebra to logic. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. Though the theory of tree automata and tree languages may have come into existence by generalizing string automata and languages, but it could not have stayed alive for long as a mere generalization. Apart from its intrinsic interest, this theory has found several applications and offers new perspectives to various parts of mathematical linguistics. It has been applied to the study of databases and XML schema languages, and provides tools for syntactic pattern recognition. When trees are defined as terms, universal algebra becomes directly applicable to tree automata and tree languages and, on the other hand, the theory of tree automata and tree languages suggests new notions and problems to universal algebra. In this book, the theory has been studied from the algebraic viewpoint.

Mathematical Foundations of Computer Science 2001

26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001 Proceedings

Author: Jiri Sgall,Ales Pultr

Publisher: Springer Science & Business Media

ISBN: 3540424962

Category: Computers

Page: 716

View: 8595

This book constitutes the refereed proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001, held in Marianske Lazne, Czech Republic in August 2001. The 51 revised full papers presented together with 10 invited contributions were carefully reviewed and selected from a total of 118 submissions. All current aspects of theoretical computer science are addressed ranging from mathematical logic and programming theory to algorithms, discrete mathematics, and complexity theory. Besides classical issues, modern topics like quantum computing are discussed as well.

Mathematical Foundations of Computer Science 2008

33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings

Author: Edward Ochmanski,Jerzy Tyszkiewicz

Publisher: Springer

ISBN: 3540852387

Category: Computers

Page: 626

View: 5919

This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.

Mathematical Foundations of Computer Science 2004

29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings

Author: Jirí Fiala,Václav Koubek,Jan Kratochvíl

Publisher: Springer

ISBN: 3540286292

Category: Computers

Page: 904

View: 1627

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.

Mathematical Foundations of Computer Science 1997

22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings

Author: Igor Privara

Publisher: Springer Science & Business Media

ISBN: 9783540634379

Category: Computers

Page: 517

View: 7406

This book constitutes the refereed post-conference proceedings of the Second International Andrei Ershov Memorial Conference on System Informatics, held in Akademgorodok, Novosibirsk, Russia, in June 1996. The 27 revised full papers presented together with 9 invited contributions were thoroughly refereed for inclusion in this volume. The book is divided in topical sections on programming methodology, artificial intelligence, natural language processing, machine learning, dataflow and concurrency models, parallel programming, supercompilation, partial evaluation, object-oriented programming, semantics and abstract interpretation, programming and graphical interfaces, and logic programming.

Acta Cybernetica

Author: N.A

Publisher: N.A


Category: Cybernetics

Page: N.A

View: 1821


Mathematical Foundations of Computer Science 1981

10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings

Author: J. Gruska,M. Chytil

Publisher: Springer Science & Business Media

ISBN: 9783540108566

Category: Computers

Page: 589

View: 3546


Foundations of Object-oriented Languages

Types and Semantics

Author: Kim B. Bruce

Publisher: MIT Press

ISBN: 9780262025232

Category: Computers

Page: 384

View: 485

A presentation of the formal underpinnings of object-oriented programming languages.

Logical Foundations of Computer Science

International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings

Author: Sergei Artemov,Anil Nerode

Publisher: Springer Science & Business Media

ISBN: 3540926860

Category: Computers

Page: 469

View: 4140

The Symposium on Logical Foundations of Computer Science series provides a forum for the fast-growing body of work in the logical foundations of computer science, e.g., those areas of fundamental theoretical logic related to computer science. The LFCS series began with “Logic at Botik,” Pereslavl-Zalessky,1989, which was co-organized by Albert R. Meyer (MIT) and Michael Taitslin (Tver). After that, organization passed to Anil Nerode. Currently LFCS is governed by a Steering Committee consisting of Anil Nerode (General Chair), Stephen Cook, Dirk van Dalen, Yuri Matiyasevich, John McCarthy, J. Alan Robinson, Gerald Sacks, and Dana Scott. The 2009 Symposium on Logical Foundations of Computer Science (LFCS 2009) took place in Howard Johnson Plaza Resort, Deer?eld Beach, Florida, USA, during January 3–6. This volume contains the extended abstracts of talks selected by the Program Committee for presentation at LFCS 2009. The scope of the symposium is broad and contains constructive mathematics and type theory; automata and automatic structures; computability and r- domness; logical foundations of programming; logical aspects of computational complexity; logic programmingand constraints;automated deduction and int- active theorem proving; logical methods in protocol and program veri?cation; logical methods in program speci?cation and extraction; domain theory l- ics; logical foundations of database theory; equational logic and term rewriting; lambda andcombinatorycalculi;categoricallogicandtopologicalsemantics;l- ear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justi?cation; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics;

Mathematical Foundations of Computer Science 2005

30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings

Author: Joanna Jedrzejowicz

Publisher: Springer Science & Business Media

ISBN: 3540287027

Category: Computers

Page: 814

View: 3312

This book constitutes the refereed proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005. The 62 revised full papers presented together with full papers or abstracts of 7 invited talks were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from quantum computing, approximation, automata, circuits, scheduling, games, languages, discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.

Mathematical Foundations of Computer Science 1993

18th International Symposium, MFCS '93, Gdansk, Poland, August 30 - September 3, 1993. Proceedings

Author: Andrzej M. Borzyszkowski,Stefan Sokolowski

Publisher: Springer

ISBN: 9783540571827

Category: Computers

Page: 782

View: 5992

This volume contains the proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS '93, held in Gdansk, Poland, August-September 1993. The MFCS symposia, organized annually in Poland and the former Czechoslovakia since 1972, have a long and well-established tradition. Over the years they have served as a meeting ground for specialists from all branches of theoretical computer science, in particular - algorithms and complexity, automata theory and theory of languages, - concurrent, distributed and real-time systems, - the theory of functional, logic and object-oriented programming, - lambda calculus and type theory, - semantics and logics of programs, and others. The volume contains 12 invitedlectures and 56 contributed papers selected from 133 submissions.

Mathematical Foundations of Computer Science 2013

38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings

Author: Krishnendu Chatterjee,Jirí Sgall

Publisher: Springer

ISBN: 3642403131

Category: Computers

Page: 854

View: 2704

This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Formal Languages and Applications

Author: Carlos Martin-Vide,Victor Mitrana

Publisher: Springer Science & Business Media

ISBN: 9783540209072

Category: Computers

Page: 620

View: 629

Formal Languages and Applications provides a comprehensive study-aid and self-tutorial for graduates students and researchers. The main results and techniques are presented in an readily accessible manner and accompanied by many references and directions for further research. This carefully edited monograph is intended to be the gateway to formal language theory and its applications, so it is very useful as a review and reference source of information in formal language theory.

Logic from Computer Science

Proceedings of a Workshop Held November 13 - 17, 1989 [at MSRI]

Author: Yiannis N. Moschovakis

Publisher: Springer Science & Business Media

ISBN: 9780387976679

Category: Mathematics

Page: 608

View: 8550

The volume is the outgrowth of a workshop with the same title held at MSRI in the week of November 13-17, 1989, and for those who did not get it, Logic from Computer Science is the converse of Logic in Computer Science, the full name of the highly successful annual LICS conferences. We meant to have a conference which would bring together the LICS commu nity with some of the more traditional "mathematical logicians" and where the emphasis would be on the flow of ideas from computer science to logic rather than the other way around. In a LICS talk, sometimes, the speaker presents a perfectly good theorem about (say) the A-calculus or finite model theory in terms of its potential applications rather than its (often more ob vious) intrinsic, foundational interest and intricate proof. This is not meant to be a criticism; the LICS meetings are, after all, organized by the IEEE Computer Society. We thought, for once, it would be fun to see what we would get if we asked the speakers to emphasize the relevance of their work for logic rather than computer science and to point out what is involved in the proofs. I think, mostly, it worked. In any case, the group of people represented as broad a selection of logicians as I have seen in recent years, and the quality of the talks was (in my view) exceptionally, unusually high. I learned a lot and (I think) others did too.

Foundations of Algebraic Specification and Formal Software Development

Author: Donald Sannella,Andrzej Tarlecki

Publisher: Springer Science & Business Media

ISBN: 3642173365

Category: Computers

Page: 584

View: 929

This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties. These foundations are built on a solid mathematical basis, using elements of universal algebra, category theory and logic, and this mathematical toolbox provides a convenient language for precisely formulating the concepts involved in software specification and development. Once formally defined, these notions become subject to mathematical investigation, and this interplay between mathematics and software engineering yields results that are mathematically interesting, conceptually revealing, and practically useful. The theory presented by the authors has its origins in work on algebraic specifications that started in the early 1970s, and their treatment is comprehensive. This book contains five kinds of material: the requisite mathematical foundations; traditional algebraic specifications; elements of the theory of institutions; formal specification and development; and proof methods. While the book is self-contained, mathematical maturity and familiarity with the problems of software engineering is required; and in the examples that directly relate to programming, the authors assume acquaintance with the concepts of functional programming. The book will be of value to researchers and advanced graduate students in the areas of programming and theoretical computer science.

Formal Methods for Computational Systems Biology

8th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2008 Bertinoro, Italy, June 2-7, 2008

Author: Marco Bernardo,Pierpaolo Degano,Gianluigi Zavattaro

Publisher: Springer Science & Business Media

ISBN: 3540688927

Category: Computers

Page: 527

View: 2352

This book presents a set of 14 papers accompanying the lectures of leading researchers given at the 8th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2008, held in Bertinoro, Italy in June 2008. SFM 2008 was devoted to formal techniques for computational systems biology and covered several aspects of the field, including computational models, calculi and logics for biological systems, and verification and simulation methods. The first part of this volume comprises nine papers based on regular lectures, the second part of this volume comprises five papers based on talks given by people involved in the Italian BISCA research project on Bio-Inspired Systems and Calculi with Applications.

Struktur Und Interpretation Von Computerprogrammen/ Structure and Interpretation of Computer Programs

Eine Informatik-einfhrung/ a Computer Science Introduction

Author: Harold Abelson,Julie Sussman,Gerald Jay Sussman

Publisher: Springer

ISBN: 9783540423423

Category: Computers

Page: 682

View: 1972

Die Übersetzung der bewährten Einführung in die Informatik, entstanden am Massachusetts Institute of Technology (MIT), wird seit Jahren erfolgreich in der Lehre eingesetzt. Schritt für Schritt werden Konstruktion und Abstraktion von Daten und Prozeduren dargestellt. Von der Modularisierung bis zum Problemlösen mit Registermaschinen werden verschiedene Programmierparadigmen entwickelt und die effektive Handhabung von Komplexität gezeigt. Als Programmiersprache wird SCHEME verwendet, ein Dialekt von LISP. Alle Programme laufen in jeder dem IEEE-Standard entsprechenden SCHEME-Implementierung.

VDM '91. Formal Software Development Methods. 4th International Symposium of VDM Europe, Noordwijkerhout, The Netherlands, October 21-25, 1991. Proceedings

Volume 1: Conference Contributions

Author: VDM Europe. International Symposium,Søren Prehn

Publisher: Springer Science & Business Media

ISBN: 9783540548348

Category: Computers

Page: 698

View: 2951

The proceedings of the fourth Vienna Development MethodSymposium, VDM'91, are published here in two volumes.Previous VDM symposia were held in 1987 (LNCS 252), 1988(LNCS 328), and 1990 (LNCS 428).The VDM symposia have been organized by VDM Europe, formedin 1985 as an advisory board sponsored by the Commission ofthe European Communities. The VDM Europe working groupconsisted of researchers, software engineers, andprogrammers, allinterested in promoting the industrialusage of formal methods for software development. The fourthVDM symposium presented not only VDM but also a large numberof other methods for formal software development.Volume 1 contains conference contributions. It has fourparts: contributions of invited speakers, papers, projectreports, and tools demonstration abstracts. The emphasis ison methods and calculi for development, verification andverification tools support, experiences from doingdevelopments, and the associated theoretical problems.Volume 2 contains four introductory tutorials (on LARCH,Refinement Calculus, VDM, and RAISE) and four advancedtutorials (on ABEL, PROSPECTRA, The B Method, and TheStack). They present a comprehensive account of the state oftheart.