Developments in language theory : foundations, applications, and perspectives : Aachen, Germany, 6-9 July 1999 /
The theory of formal languages is one of the oldest branches of theoretical computer science. Its original aim (in the fifties and sixties) was to clarify the laws and algorithms that underlie the definition and compilation of programming languages. Since then, formal language theory has changed ver...
Saved in:
Corporate Authors: | ; |
---|---|
Group Author: | ; |
Published: |
World Scientific Pub. Co.,
|
Publisher Address: | Singapore ; River Edge, N.J. : |
Publication Dates: | 2000. |
Literature type: | eBook |
Language: | English |
Subjects: | |
Online Access: |
http://www.worldscientific.com/worldscibooks/10.1142/4489#t=toc |
Summary: |
The theory of formal languages is one of the oldest branches of theoretical computer science. Its original aim (in the fifties and sixties) was to clarify the laws and algorithms that underlie the definition and compilation of programming languages. Since then, formal language theory has changed very much. Today it includes mathematical topics like combinatorics of words, word equations, and coding theory, but it also covers connections to linguistics (for example, the study of contextual grammars), new computational paradigms (like DNA computing), and a wide range of applications, among the |
Item Description: | "This volume contains the papers presented at the Fourth International Conference 'Developments in Language Theory' (DLT)"--P. v. |
Carrier Form: | 1 online resource (ix,385pages) : illustrations |
Bibliography: | Includes bibliographical references. |
ISBN: | 9789812792464 |
CLC: | O141-532 |
Contents: | Invited lectures. Special factors in some combinatorial structures / A. Carpi, A. de Luca, S. Varricchio -- Subword complexity and periodicity in two or more dimensions / J. Cassaigne -- On the decomposition of finite languages / A. Salomaa, Sh. Yu -- Computation = self-assembly + conformational change: toward new computing paradigms / T. Yokomori -- Contributed papers. I. Automata and Languages. Asynchronous sliding block maps / M.-P. Beal, O. Carton -- Bisimulations and behaviour of nondeterministic automata / C.S. Calude, E. Calude -- Deterministic forgetting planar automata are more powe |