Juhani Karhumäki

Tero Harju

Arto Lepistö

This book constitutes the refereed proceedings of the 11th International Conference on Developments in Language Theory, DLT 2007, held in Turku, Finland in July 2007. It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.

11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings

Developments in Language Theory

Grzegorz Rozenberg

Hermann Maurer

Gheorghe Paun

This commemorative book celebrates the 70th birthday of Arto Kustaa Salomaa, one of the most influential researchers in theoretical computer science. The 24 invited papers by leading researchers in the area address a broad variety of topics in theoretical computer science and impressively reflect the breadth and the depth of Arto Salomaa's scientific work.

Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday

Theory Is Forever

Lauri Karttunen

Anssi Yli-Jyrä

This book constitutes the thoroughly refereed post-proceedings of the 5th International Workshop on Finite-State Methods in Natural Language Processing, FSMNLP 2005, held in Helsinki, Finland, September 2005. The book presents 24 revised full papers and seven revised poster papers together with two invited contributions and abstracts of six software demos. Topics include morphology, optimality theory, some special FSM families, weighted FSM algorithms, FSM representations, exploration, ordered structures, and surface parsing.

5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers

Finite-State Methods and Natural Language Processing

Donald Sannella

Josep Diaz

The 31st International Colloquium on Automata, Languages, and Programming (ICALP 2004) was held from July 12 to July 16 in Turku, Finland. This volume contains all contributed papers presented at ICALP 2004, together with the invitedlecturesbyPhilippeFlajolet(INRIA), RobertHarper(CarnegieMellon), Monika Henzinger (Google), Martin Hofmann (Munich), Alexander Razborov (Princeton and Moscow), Wojciech Rytter (Warsaw and NJIT), and Mihalis Yannakakis (Stanford). ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS). The?rst ICALP took place in 1972 and the ICALP program currently consists of track A (focusing on algorithms, automata, complexity, and cryptography) and track B (focusing on databases, logics, semantics, and principles of programming). Inresponsetothecallforpapers, theprogramcommitteereceived379papers, 272 for track A and 107 for track B. This is the highest number of submitted papersinthehistoryofICALPconferences. Theprogramcommitteesselected97 papersforinclusionintothescienti?cprogram. Theprogramcommitteefortrack A met on March 27 and 28 in Barcelona and selected 69 papers from track A. TheprogramcommitteefortrackBselected28papersfromtrackBinthecourse of an electronic discussion lasting for two weeks in the second half of March. The selections were based on originality, quality, and relevance to theor- ical computer science. We wish to thank all authors who submitted extended abstracts for consideration, the program committee for its hard work, and all referees who assisted the program committee in the evaluation process.

31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings

Automata, Languages and Programming

Alexander Okhotin

Helmut Jürgensen

This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of objects, state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; complexity aspects of combinatorics on words; Kolmogorov complexity.

16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings

Descriptional Complexity of Formal Systems

Luke Ong

Giancarlo Mauri

Giorgio Ausiello

The papers containedin this volume were presentedat the 5th IFIP InternationalC- ference on Theoretical Computer Science (IFIP TCS), 7-10 September 2008, Milan, Italy. TCS is a bi-annual conference.The ?rst conferenceof the series was held in Sendai (Japan, 2000), followed by Montreal (Canada, 2002), Toulouse (France, 2004) and Santiago (Chile, 2006).TCS is organizedby IFIP TC1 (Technical Committee 1: Fo- dations of Computer Science) and Working Group 2.2 of IFIP TC2 (Technical C- mittee 2: Software: Theory and Practice). TCS 2008 was part of the 20th IFIP World Computer Congress (WCC 2008), constituting the TC1 Track of WCC 2008. The contributed papers were selected from 36+45 submissions from altogether 30 countries. A total of 14+16 submissions were accepted as full papers. Papers in this volume are original contributions in two general areas: Track A: Algorithms, C- plexity and Models of Computation;and Track B: Logic, Semantics, Speci?cation and Veri?cation. The conference also included seven invited presentations, from Luca Cardelli, Thomas Ehrhard, Javier Esparza, Antonio Restivo, Tim Roughgarden, Gr- gorz Rozenberg and Avraham Trakhtman. These presentations are included (except one) in this volume. In particular, Luca Cardelli, Javier Esparza, Antonio Restivo, Tim Roughgarden and Avraham Trakhtman accepted our invitation to write full papers - lated to their talks.

IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy

Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008

International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of refereed international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit www.springer.com. For more information about IFIP, please visit www.ifip.org.

Luca Zamboni

This book constitutes the refereed proceedings of the 9th International Conference on Combinatorics on Words, WORDS 2013, held in Turku, Finland, in September 2013 under the auspices of the EATCS. The 20 revised full papers presented were carefully reviewed and selected from 43 initial submissions. The central topic of the conference is combinatorics on words (i.e. the study of finite and infinite sequence of symbols) from varying points of view, including their combinatorial, algebraic and algorithmic aspects, as well as their applications.

9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings

Combinatorics on Words

Hartmut Ehrig

Wilfried Brauer

Arto K. Salomaa

This book presents state of the art research in theoretical computer science and related ?elds. In particular, the following areas are discussed: automata theory, formal languages and combinatorics of words, graph transformations, Petri nets, concurrency, as well as natural and molecular computing. The articles are written by leading researchers in these areas. The writers were originally invited to contribute to this book but then the normal refereeing procedure was applied as well. All of the articles deal with some issue that has been under vigorous study during recent years. Still, the topics range from very classical ones to issues raised only two or three years ago. Both survey articles and papers attacking speci?c research problems are included. The book highlights some key issues of theoretical computer science, as they seem to us now at the beginning of the new millennium. Being a comprehensive overview of some of the most active current research in theoretical computer science, it should be of de?nite interest for all researchers in the areas covered. The topics range from basic decidability and the notion of information to graph grammars and graph transformations, and from trees and traces to aqueous algorithms, DNA encoding and self-assembly. Special e?ort has been given to lucid presentation. Therefore, the book should be of interest also for advanced students.

Essays Dedicated to Grzegorz Rozenberg

Formal and Natural Computing

Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on behalf of the theoretical computer science community. The contributions are written by internationally recognized scientists and cover most of Salomaa's many research areas. Due to its representative selection of classic and cutting edge trends in theoretical computer science, the book constitutes a comprehensive state-of-the-art survey. The contributions are in such central areas as automata theory, algorithms and complexity, and combinatorics of words. But not only that, they take up new areas such as regular sets and biocomputing. While some are survey articles of fundamental topics, most are original research papers.

Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Jewels are Forever

Pavol Návrat

Mária Bieliková

Alberto Bertoni

Villiam Geffert

Bart Preneel

This book constitutes the refereed proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2008, held in Slovakia, in 2008. The 57 revised full papers, presented together with 10 invited contributions, were carefully reviewed and selected from 162 submissions. The contributions are segmented into four topical sections on foundations of computer science; computing by nature; networks, security, and cryptography; and Web technologies.

34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings

SOFSEM 2008: Theory and Practice of Computer Science

Juhani Karhumäki

About

Books

Join the club