A Structural Theory for Varieties of Tree Languages

Author: Saeed Salehi

Publisher: VDM Verlag Dr. Muller

ISBN: 3639230558

Category:

Page: 164

View: 7540

DOWNLOAD NOW »

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.
Release

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

DOWNLOAD NOW »

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.
Release

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

DOWNLOAD NOW »

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.
Release

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

DOWNLOAD NOW »

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.
Release

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

DOWNLOAD NOW »

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.
Release

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

DOWNLOAD NOW »

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.
Release

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

DOWNLOAD NOW »

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.
Release