New trends in formal languages : control, cooperation, and combinatorics
This book presents a collection of refereed papers on formal language theory arranged for the occasion of the 50th birthday of Jürgen Dassow, who has made a significant contribution to the areas of regulated rewriting and grammar systems. The volume comprises 33 revised full papers organized in sect...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
1218 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • New trends in formal languages, control, cooperation, and combinatorics, Gheorghe Păun, Arto Salomaa, eds, 1997, Berlin, Springer, 1 vol. (IX-464 p.), Lecture notes in computer science, 3-540-62844-4 • New Trends in Formal Languages, Texte imprimé, 9783662176955 |
Obsah:
- A grammatical approach to the LBA problem
- Conditional context-free languages of finite index
- On the number of nonterminals in matrix grammars with leftmost derivations
- The accepting power of finite automata over groups
- Controlled fuzzy parallel rewriting
- On controlling rewriting by properties of strings and symbols
- Accepting array grammars with control mechanisms
- On restarting automata with rewriting
- Deterministic cooperating distributed grammar systems
- Grammar systems with counting derivation and dynamical priorities
- Characterization of RE using CD grammar systems with two registers and RL rules
- On cooperating distributed uniformly limited 0L systems
- Teams in grammar systems: Sub-context-free cases
- A note on the incomparability of the E0L family with certain families of languages generated by cooperating grammar systems
- Colonies as models of reactive systems
- Grammatical inference of colonies
- A grammar characterization of logarithmic-space computation
- On the computational complexity of context-free Parallel Communicating Grammar Systems
- Parallel communicating grammar systems with communication by signals
- PC grammar systems versus some non-context-free constructions from natural and artificial languages
- Grammar systems for the description of certain natural language facts
- Networks of parallel language processors
- A reduced distributed splicing system for RE languages
- On the generative capacity of splicing grammar systems
- Array splicing systems
- Two lower bounds on computational complexity of infinite words
- On ?-power languages
- Shuffle-like operations on ?-words
- Generalized Lindenmayerian algebraic systems
- The structure of the basic morphisms
- On mix operation
- On the complexity of iterated insertions
- Thedecidability of the generalized confluence problem for context-free languages.