A Structural Theory for Varieties of Tree Languages


Author: Saeed Salehi
Publisher: VDM Verlag Dr. Muller
ISBN: 3639230558
Category:
Page: 164
View: 1675

Continue Reading →

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: 5425

Continue Reading →

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: 8293

Continue Reading →

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 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: 3078

Continue Reading →

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.

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: 9871

Continue Reading →

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.

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
Author: Kamal Lodaya,Meena Mahajan
Publisher: Springer
ISBN: N.A
Category: Computers
Page: 532
View: 4331

Continue Reading →

This book constitutes the refereed proceedings of the 24th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, held in Chennai, India, in December 2004. The 35 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 176 submissions. The papers address a broad variety of current issues in software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, automata theory, and theoretical computer science in general.

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: 2811

Continue Reading →

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.

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: N.A
Category: Computers
Page: 902
View: 1667

Continue Reading →

This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004. The 60 revised full papers presented together with full papers or abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.

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: 9676

Continue Reading →

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.

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: 344

Continue Reading →

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;

Formal Languages and Applications


Author: Carlos Martin-Vide,Victor Mitrana
Publisher: Springer Science & Business Media
ISBN: 9783540209072
Category: Computers
Page: 620
View: 1511

Continue Reading →

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.

Mathematical foundations of computer science 1993

18th International Symposium, MFCS'93, Gdańsk, Poland, August 30-September 3, 1993 : proceedings
Author: Andrzej M. Borzyszkowski,Stefan Sokołowski
Publisher: Springer
ISBN: 9783540571827
Category: Computers
Page: 781
View: 8205

Continue Reading →

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

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: 6686

Continue Reading →

Topics of this proceedings volume will include Computability and Complexity of Higher Type Functions by Stephen Cook, Logics for Termination and Correctness of Functional Programs by Solomon Feferman, Reals and Forcing with Elementary Topos by the well known mathematician, Saunders MacLane and Ieke Moerdijk, and Concurrent Computation as Game Playing by Anil Nerode.

Handbook of Theoretical Computer Science: Formal models and semantics


Author: Jan Leeuwen
Publisher: Elsevier Science
ISBN: 9780444880741
Category: Computers
Page: 1280
View: 9787

Continue Reading →

The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing.

Algebraic Foundations in Computer Science

Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement
Author: Werner Kuich,George Rahonis
Publisher: Springer
ISBN: 3642248977
Category: Computers
Page: 363
View: 6357

Continue Reading →

This Festschrift volume, published in honor of Symeon Bozapalidis on the occasion of his retirement after more than 35 years of teaching activity, focuses on the subjects taught by Symeon, namely: algebra, linear algebra, mathematical logic, number theory, automata theory, tree languages and series, algebraic semantics, and fuzzy languages. Since 1982 -- at the Aristotle University of Thessaloniki -- Symeon's main interests have been closely connected with the algebraic foundations in computer science. In particular, he contributed to the development of the theory of tree languages and series, the axiomatization of graphs, picture theory, and fuzzy languages. The volume contains 15 invited papers, written by colleagues, friends, and students of Symeon. All of the papers were carefully refereed and are connected to his research topics. Most of the papers were presented at the Workshop on Algebraic Foundations in Computer Science, held in Thessaloniki, Greece, during November 7--8, 2011.