Paun
New Trends in Formal Languages
Control, Cooperation, and Combinatorics
Mitarbeit:Paun, Gheorghe; Salomaa, Arto
Paun
New Trends in Formal Languages
Control, Cooperation, and Combinatorics
Mitarbeit:Paun, Gheorghe; Salomaa, Arto
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
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 sections on regulated rewriting, cooperating distributed grammar systems, parallel communicating grammar systems, splicing systems, infinite words, and algebraic approaches to languages.
Andere Kunden interessierten sich auch für
- KarhumäkiResults and Trends in Theoretical Computer Science42,99 €
- Javier Leach Albert / Burkhard Monien / Mario Rodriguez Artalejo (eds.)Automata, Languages and Programming83,99 €
- DershowitzConditional and Typed Rewriting Systems42,99 €
- Jörg Flum / Mario Rodriguez-Artalejo (eds.)Computer Science Logic42,99 €
- Michael Rusinowitch / Jean-Luc Remy (eds.)Conditional Term Rewriting Systems42,99 €
- GanzingerRewriting Techniques and Applications42,99 €
- Dines Bjorner / Manfred Broy / Alexandre V. Zamulin (eds.)Perspectives of System Informatics83,99 €
-
-
-
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 sections on regulated rewriting, cooperating distributed grammar systems, parallel communicating grammar systems, splicing systems, infinite words, and algebraic approaches to languages.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
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 algebraic approaches to languages.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 1218
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 10549399, 978-3-540-62844-6
- 1997.
- Seitenzahl: 484
- Erscheinungstermin: 9. April 1997
- Englisch
- Abmessung: 235mm x 155mm x 27mm
- Gewicht: 632g
- ISBN-13: 9783540628446
- ISBN-10: 3540628444
- Artikelnr.: 09240176
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
- Lecture Notes in Computer Science 1218
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 10549399, 978-3-540-62844-6
- 1997.
- Seitenzahl: 484
- Erscheinungstermin: 9. April 1997
- Englisch
- Abmessung: 235mm x 155mm x 27mm
- Gewicht: 632g
- ISBN-13: 9783540628446
- ISBN-10: 3540628444
- Artikelnr.: 09240176
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
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.
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.