Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1218

• A grammatical approach to the LBA problem
  Henning Bordihn
  Lecture Notes in Computer Science 1218, 1997, pp. 1-9
• Conditional context-free languages of finite index
  Henning Fernau, Markus Holzer
  Lecture Notes in Computer Science 1218, 1997, pp. 10-26
• On the number of nonterminals in matrix grammars with leftmost derivations
  Alexander Meduna
  Lecture Notes in Computer Science 1218, 1997, pp. 27-38
• The accepting power of finite automata over groups
  Victor Mitrana, Ralf Stiebe
  Lecture Notes in Computer Science 1218, 1997, pp. 39-48
• Controlled fuzzy parallel rewriting
  Peter R.J. Asveld
  Lecture Notes in Computer Science 1218, 1997, pp. 49-70
• On controlling rewriting by properties of strings and symbols
  Paolo Bottoni, Giancarlo Mauri, Piero Mussio
  Lecture Notes in Computer Science 1218, 1997, pp. 71-94
• Accepting array grammars with control mechanisms
  Henning Fernau, Rudolf Freund
  Lecture Notes in Computer Science 1218, 1997, pp. 95-118
• On restarting automata with rewriting
  Petr Janc̑ar, Frantis̑ek Mráz, Martin Plátek, Jörg Vogel
  Lecture Notes in Computer Science 1218, 1997, pp. 119-136
• Deterministic cooperating distributed grammar systems
  Valeria Mihalache, Victor Mitrana
  Lecture Notes in Computer Science 1218, 1997, pp. 137-149
• Grammar systems with counting derivation and dynamical priorities
  Tudor Bălănescu, Horia Georgescu, Marian Gheorghe
  Lecture Notes in Computer Science 1218, 1997, pp. 150-166
• Characterization of RE using CD grammar systems with two registers and RL rules
  Sorina Dumitrescu
  Lecture Notes in Computer Science 1218, 1997, pp. 167-177
• On cooperating distributed uniformly limited 0L systems
  Dietmar Wätjen
  Lecture Notes in Computer Science 1218, 1997, pp. 178-196
• Teams in grammar systems: Sub-context-free cases
  Maurice H. Ter Beek
  Lecture Notes in Computer Science 1218, 1997, pp. 197-216
• A note on the incomparability of the E0L family with certain families of languages generated by cooperating grammar systems
  Mohamed Amin
  Lecture Notes in Computer Science 1218, 1997, pp. 217-219
• Colonies as models of reactive systems
  Jozef Kelemen
  Lecture Notes in Computer Science 1218, 1997, pp. 220-235
• Grammatical inference of colonies
  Petr Sosík, Leos̑ S̑týbnar
  Lecture Notes in Computer Science 1218, 1997, pp. 236-246
• A grammar characterization of logarithmic-space computation
  Karl Abrahamson, Liming Cai, Steve Gordon
  Lecture Notes in Computer Science 1218, 1997, pp. 247-255
• On the computational complexity of context-free parallel communicating grammar systems
  Ştefan Bruda
  Lecture Notes in Computer Science 1218, 1997, pp. 256-266
• Parallel communicating grammar systems with communication by signals
  Daniel Popescu
  Lecture Notes in Computer Science 1218, 1997, pp. 267-277
• PC grammar systems versus some non-context-free constructions from natural and artificial languages
  Adrian Chiţu
  Lecture Notes in Computer Science 1218, 1997, pp. 278-287
• Grammar systems for the description of certain natural language facts
  Maria Dolores Jiménez-López, Carlos Martín-Vide
  Lecture Notes in Computer Science 1218, 1997, pp. 288-298
• Networks of parallel language processors
  Erzsébet Csuhaj-Varjú, Arto Salomaa
  Lecture Notes in Computer Science 1218, 1997, pp. 299-318
• A reduced distributed splicing system for RE languages
  Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
  Lecture Notes in Computer Science 1218, 1997, pp. 319-329
• On the generative capacity of splicing grammar systems
  Gianina Georgescu
  Lecture Notes in Computer Science 1218, 1997, pp. 330-345
• Array splicing systems
  Kamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama
  Lecture Notes in Computer Science 1218, 1997, pp. 346-365