Jurgen Dassow – författare

First Published in 1994. The central problem of the “classic” formal language theory concerns the generation (the recognition) of languages by grammars (automata, respectively). However, in present day computer science, in artificial intelligence, in cognitive psychology and in other related fields we have to deal more and more with complex tasks distributed among a set of “ processors” , which are working together in a well defined way. Parallel computers, computer nets, distributed data bases and knowledge sources are practical materializations of this idea. Similarly, the psychologists speak about the modularity of mind, in problem solving theories there appear many models based on cognitive agents’ cooperation. As the formal language theory is involved in most of these circumstances (for example, as a theoretical framework, well developed from a mathematical point of view, for modelling aspects whose essence can be captured at the level of symbol systems, of the syntax of collections of strings of abstract symbols), a clear challenge appears for it: to consider systems o f grammars/automata, working together for generating/recognizing a language. In this context, notions such as distribution, cooperation, communication, concurrency, synchronization, parallelism etc. should be formalized and enlightened. The present monograph is an attempt to answer this challenge.

First Published in 1994. The central problem of the “classic” formal language theory concerns the generation (the recognition) of languages by grammars (automata, respectively). However, in present day computer science, in artificial intelligence, in cognitive psychology and in other related fields we have to deal more and more with complex tasks distributed among a set of “ processors” , which are working together in a well defined way. Parallel computers, computer nets, distributed data bases and knowledge sources are practical materializations of this idea. Similarly, the psychologists speak about the modularity of mind, in problem solving theories there appear many models based on cognitive agents’ cooperation. As the formal language theory is involved in most of these circumstances (for example, as a theoretical framework, well developed from a mathematical point of view, for modelling aspects whose essence can be captured at the level of symbol systems, of the syntax of collections of strings of abstract symbols), a clear challenge appears for it: to consider systems o f grammars/automata, working together for generating/recognizing a language. In this context, notions such as distribution, cooperation, communication, concurrency, synchronization, parallelism etc. should be formalized and enlightened. The present monograph is an attempt to answer this challenge.

First Published in 1994. The central problem of the “classic” formal language theory concerns the generation (the recognition) of languages by grammars (automata, respectively). However, in present day computer science, in artificial intelligence, in cognitive psychology and in other related fields we have to deal more and more with complex tasks distributed among a set of “ processors” , which are working together in a well defined way. Parallel computers, computer nets, distributed data bases and knowledge sources are practical materializations of this idea. Similarly, the psychologists speak about the modularity of mind, in problem solving theories there appear many models based on cognitive agents’ cooperation. As the formal language theory is involved in most of these circumstances (for example, as a theoretical framework, well developed from a mathematical point of view, for modelling aspects whose essence can be captured at the level of symbol systems, of the syntax of collections of strings of abstract symbols), a clear challenge appears for it: to consider systems o f grammars/automata, working together for generating/recognizing a language. In this context, notions such as distribution, cooperation, communication, concurrency, synchronization, parallelism etc. should be formalized and enlightened. The present monograph is an attempt to answer this challenge.

No detailed description available for "Completeness Problems in the Structural Theory of Automata".

No detailed description available for "Completeness Problems in the Structural Theory of Automata".

No detailed description available for "Regulated Rewriting in Formal Language Theory".

No detailed description available for "Regulated Rewriting in Formal Language Theory".

Logik ist eine wichtige Grundlage der Informatik. Sie ist für die Formalisierung der Softwaretechnik, für Verifikation und Spezifikation von Programmen und Datenbanken genauso erforderlich wie für die logische Programmierung und die Künstliche Intelligenz.Dieses Buch entstand auf der Basis von Vorlesungen zur Logik, die der Autor seit Jahren für Studierende der Informatik und informatiknaher Studiengänge hält. Es gibt eine Einführung in die Logik aus der Sicht der Informatik. Daher werden nicht nur fundamentale Konzepte und Aussagen der Aussagenlogik und der Prädikatenlogik (erster Stufe) angegeben, die auch für die Mathematik und die Philosophie bedeutsam sind, sondern auch algorithmische Fragen, Beziehungen zur logischen Programmierung und spezielle, für die Informatik wichtige, weitere Logiken ausführlich diskutiert.

The volume contains selected contributions from the scientific programme of the 5th International Meeting of Young Computer Scientists (IMYCS '88) held at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions dealing with problems of decidability, hierarchy, and complexity. Papers concerning different types and problems of automata theory form the second chapter. The contributions in the third chapter cover the large field of algorithmics from the study of program complexity to the domain of computational geometry. The two contributions of the fourth chapter are devoted to logic programming and inductive inference. The final chapter deals with problems of cryptography and contains the text of the IMYCS '88 tutorial on cryptography and data security delivered by A. Salomaa. The book will be a useful source for orientation in contemporary theoretical computer science and related fields such as software engineering and artificial intelligence for researchers and graduate students.

This volume contains the texts of the tutorial lecture, five invited lectures and twenty short communications contributed for presentation at the Sixth International Meeting of Young Computer Scientists, IMYCS '90. The aim of these meetings is threefold: (1) to inform on newest trends, results, and problems in theoretical computer science and related fields through a tutorial and invited lectures delivered by internationally distinguished speakers, (2) to provide a possibility for beginners in scientific work to present and discuss their results, and (3) to create an adequate opportunity for establishing first professional relations among the participants.

Der Tagungsband der 28. Jahrestagung der Gesellschaft für Informatik gibt einen Überblick über diejenigen Trends in den Gebieten Bild- und Sprachverarbeitung, die für die weitere Entwicklung der Informatik eine Schlüsselrolle spielen. In den Beiträgen werden Resultate der Spitzenforschung präsentiert, Anwendungen aus der Industrie formuliert und die gesellschaftliche Relevanz der betrachteten Themengebiete beleuchtet.

Der Tagungsband der 28. Jahrestagung der Gesellschaft für Informatik gibt einen Überblick über diejenigen Trends in den Gebieten Bild- und Sprachverarbeitung, die für die weitere Entwicklung der Informatik eine Schlüsselrolle spielen. In den Beiträgen werden Resultate der Spitzenforschung präsentiert, Anwendungen aus der Industrie formuliert und die gesellschaftliche Relevanz der betrachteten Themengebiete beleuchtet.

To our families The formal language theory was born in the middle of our century as a tool for modelling and investigating the syntax of natural languages, and it has been developed mainly in connection with programming language handling. Of course, one cannot deny the impulses from neuronal net investigations, from logic, as well as the mathematical motivation of the early researches. The theory has rapidly become a mature one, with specific problems, techniques and results and with an internal self-motivated life. Abstract enough to deal with the essence of modelled phenomena, formal language theory has been applied during the last years to many further non-linguistical fields, sometimes surprisingly far from the previous areas of applications; such fields are developmental biology, economic modelling, semiotics of folklore, dramatic and musical works, cryptography, sociology, psychology, and so on. All these applications as well as the traditional ones to natural and programming languages revealed a rather common conclusion: very frequently, context-free gram­ mars, the most developed and the most "tractable" type of Chomsky grammars, are not sufficient. "The world is non-context-free" (and we shall "prove" this statement in Section 0.4). On the other hand, the context-sensitive grammars are too powerful and definitely "intractable" (many problems are undecidable or are still open; there is no semantic interpretation of the nonterminals an so on). This is the reason to look for intermediate generative devices, conjoining the simpli­ city and the beauty of context-free grammars with the power of context-sensitive ones.