Titlebook: New Trends in Formal Languages; Control, Cooperation Gheorghe Păun,Arto Salomaa Book 1997 Springer-Verlag Berlin Heidelberg 1997 Formale Sp

分离

Controlled fuzzy parallel rewriting,o the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyper-AFFL, i.e., a hyper-algebraically closed full Abstract Family of Fuzzy Languages.

细胞

On restarting automata with rewriting,ng into account (non)determinism and two other natural properties..Theoretical significance of the restarting automata is also demonstrated by relating it to context-free languages (.), by which a characterization of deterministic . is obtained.

Dedication

prodrome

A grammatical approach to the LBA problem, the one hand and the relationship between the families of languages described by λ-free programmed grammars with degree of non-regulation one and two on the other hand. Especially, in case of accepting programmed grammars with monotone core rules and leftmost derivations this relationship exactly characterizes the lba problem.

起草

Conditional context-free languages of finite index,ful than conditional context-free languages with regular conditions of finite index. Furthermore, we study the complexity of membership and non-emptiness for conditional and programmed languages respectively grammars (of finite index) with regular, linear, and context-free core rules and conditions.

collagenase

On the computational complexity of context-free Parallel Communicating Grammar Systems,t condition for linear space complexity of returning context-free PCGSs. Based on this complexity characterization we also investigate the generative power of context-free PCGSs with respect to context-sensitive PCGSs and context-sensitive grammars.

arsenal

0302-9743 ed in sections on regulated rewriting, cooperating distributed grammar systems, parallel communicating grammar systems, splicing systems, infinite words, and algebraic approaches to languages.978-3-540-62844-6978-3-540-68703-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

捐助

On controlling rewriting by properties of strings and symbols,hanisms in their rewriting relations. Hierarchies in the families are discussed and some relations among them presented. We also start the exploration of the closure properties of these language families. Finally, we discuss some relations among the proposed families of L-systems and families of grammar systems.

frozen-shoulder

0302-9743 , who has made a significant contribution to the areas of regulated rewriting and grammar systems..The volume comprises 33 revised full papers organized in sections on regulated rewriting, cooperating distributed grammar systems, parallel communicating grammar systems, splicing systems, infinite wor

Grasping

Book 1997made a significant contribution to the areas of regulated rewriting and grammar systems..The volume comprises 33 revised full papers organized in sections on regulated rewriting, cooperating distributed grammar systems, parallel communicating grammar systems, splicing systems, infinite words, and al