A01=Erzsebet Csuhaj-Varju
A01=Gheorghe Paun
A01=Jozef Kelemen
A01=Jurgen Dassow
Appearance Checking
Author_Erzsebet Csuhaj-Varju
Author_Gheorghe Paun
Author_Jozef Kelemen
Author_Jurgen Dassow
Category=UMX
Category=UYQL
Chomsky Grammars
Chomsky Normal Form
cognitive modelling
Component Grammars
concurrency theory
Context Free Grammar
Context Free Languages
Context Free Rules
Context Sensitive Grammars
Contextual Grammar
cooperating distributed grammar systems
cooperative grammar system analysis
Disjoint Finite Sets
distributed computing models
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
ErzsT Csuhaj-Varj
Formal Grammars
formal language theory
Gheorghe P?
Grammar Systems
Jozef Kelemen
JRgen Dassow
Large Family
Lindenmayer Systems
Multiagent Systems
non-context-free component grammars
parallel communicating grammar systems
PC System
Phrase Structure Grammar
Physical Symbol System Hypothesis
Problem Solving Systems
Pure Grammars
Random Context
Regular Languages
Start Symbol
Strong Ai
symbolic computation
Product details
- ISBN 9782881249570
- Weight: 453g
- Dimensions: 174 x 246mm
- Publication Date: 23 Sep 1994
- Publisher: Gordon & Breach Science Publishers SA
- Publication City/Country: NL
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Erzsebet Csuhaj-Varju, Jurgen Dassow, Jozef Kelemen, Gheorghe Paun Institute of Mathematics The Romanian Academy of Sciences, Bucuresti, Romania
