Conference Papers of the Research Group "Formal Languages and Automata"

Search for Authors and/or Keywords: Author(s): Keywords:

2011 JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE, Generating Networks of Splicing Processors. In: Third Workshop on Non-Classical Models of Automata and Applications (NCMA), Milano, Italy, July 18–19, 2011, Proceedings. books@ocg.at 282, Österreichische Computer Gesellschaft, Austria, 2011, 121–136. JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE, Networks of Evolutionary Processors with Subregular Filters. In: ADRIAN HORIA DEDIU, SHUNSUKE INENAGA, CARLOS MARTÍN-VIDE (eds.), Language and Automata Theory and Applications. Fifth International Conference, LATA 2011, Tarragona, Spain, May 26 – 31, 2011. LNCS 6638, Springer, 2011, 262–273. JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE, Netze evolutionärer Prozessoren mit subregulären Filtern. In: JÜRGEN DASSOW, BIANCA TRUTHE (eds.), 21. Theorietag `Automaten und Formale Sprachen', Allrode (Harz), 27.–29.9.2011, Tagungsband. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2011, 29–32. JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE, On Contextual Grammars with Subregular Selection Languages. In: 13th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2011, Gießen, Germany, July 25–27, 2011, Proceedings. LNCS 6808, Springer, 2011, 135–146. JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE, On Normal Forms for Networks of Evolutionary Processors. In: JARKKO KARI, ION PETRE (eds.), Unconventional Computation. 10th International Conference, UC 2011, Turku, Finland, June 6 – 10, 2011. LNCS 6714, Springer, 2011, 89–100. HENNING FERNAU, RALF STIEBE, Über CD Grammatiksysteme mit Valenzregeln. In: JÜRGEN DASSOW, BIANCA TRUTHE (eds.), 21. Theorietag `Automaten und Formale Sprachen', Allrode (Harz), 27.–29.9.2011, Tagungsband. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2011, 33–36. FLORIN MANEA, BIANCA TRUTHE, Accepting Networks of Evolutionary Processors with Subregular Filters. In: PÁL DÖMÖSI, SZABOLCS IVÁN (eds.), Automata and Formal Languages – 13th International Conference AFL 2011, Debrecen, Hungary, August 17–22, 2011, Proceedings. College of Nyíregyháza, 2011, 300–314. SHERZOD TURAEV, JÜRGEN DASSOW, MOHD HASAN SELAMAT, Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. In: 13th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2011, Gießen, Germany, July 25–27, 2011, Proceedings. LNCS 6808, Springer, 2011, 289–300. 2010 JÜRGEN DASSOW, FLORIN MANEA, Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. In: IAN MCQUILLAN, GIOVANNI PIGHIZZINI, BRETT TROST (eds.), 12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Saskatchewan, Canada, August 8–10, 2010, Proceedings. Technical Report 2010-02, University of Saskatchewan, Department of Computer Science, 2010, 86–97. JÜRGEN DASSOW, FLORIN MANEA, Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. In: IAN MCQUILLAN, GIOVANNI PIGHIZZINI (eds.), 12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Saskatchewan, Canada, August 8–10, 2010, Proceedings. EPTCS 31, 2010, 68–77. JÜRGEN DASSOW, TOMÁS MASOPUST, On restricted context-free grammars. In: YUAN GAO, HANLIN LU, SHINNOSUKE SEKI, SHENGYU (eds.), Developments in Language Theory. 14th International Conference, DLT 2010, London, ON, Canada, August 17–20, 2010, Proceedings. LNCS 6224, Springer, 2010, 434–435. JÜRGEN DASSOW, BIANCA TRUTHE, On Networks of Evolutionary Processors with State Limited Filters. In: HENNING BORDIHN, RUDOLPH FREUND, THOMAS HINZE, MARKUS HOLZER, MARTIN KUTRIB, FRIEDRICH OTTO (eds.), Second Workshop on Non-Classical Models of Automata and Applications (NCMA), Jena, Germany, August 23–24, 2010, Proceedings. books@ocg.at 263, Österreichische Computer Gesellschaft, Austria, 2010, 57–70. BIANCA TRUTHE, On the Descriptional Complexity of Limited Propagating Lindenmayer Systems. In: IAN MCQUILLAN, GIOVANNI PIGHIZZINI, BRETT TROST (eds.), 12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Saskatchewan, Canada, August 8–10, 2010, Proceedings. Technical Report 2010-02, University of Saskatchewan, Department of Computer Science, 2010, 215–226. BIANCA TRUTHE, On the Descriptional Complexity of Limited Propagating Lindenmayer Systems. In: IAN MCQUILLAN, GIOVANNI PIGHIZZINI (eds.), 12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Saskatchewan, Canada, August 8–10, 2010, Proceedings. EPTCS 31, 2010, 177–188. BIANCA TRUTHE, On the Descriptional Complexity of Limited Propagating Lindenmayer Systems. In: MARCEL VOLLWEILER FRIEDRICH OTTO, NORBERT HUNDESHAGEN (ed.), 20. Theorietag der GI-Fachgruppe AFS `Automaten und Formale Sprachen', Baunatal bei Kassel, 29.9.–-1.10.2010. Technical Report 2010/03, Universität Kassel, 2010, 122–128. 2009 JÜRGEN DASSOW, GEMA M. MARTÍN, FRANCISCO J. VICO, Evolving under small disruption. In: HENNING BORDIHN, RUDOLPH FREUND, MARKUS HOLZER, MARTIN KUTRIB, FRIEDRICH OTTO (eds.), Workshop on Non-Classical Models of Automata and Applications (NCMA), Wrocław, Poland, August 31 – September 1, 2009, Proceedings. books@ocg.at 256, Österreichische Computer Gesellschaft, Austria, 2009, 91–106. JÜRGEN DASSOW, SHERZOD TURAEV, Grammars Controlled by Special Petri Nets. In: CARLOS MARTÍN-VIDE, ADRIAN HORIA DEDIU, MIHAI IONESCU (eds.), Language and Automata Theory and Applications. Third International Conference, LATA 2009, Tarragona, Spain, April 2 – 8, 2009. LNCS 5457, Springer, 2009, 326–337. VICTOR MITRANA, BIANCA TRUTHE, On Accepting Networks of Evolutionary Processors With at Most Two Types of Nodes. In: CARLOS MARTÍN-VIDE, ADRIAN HORIA DEDIU, MIHAI IONESCU (eds.), Language and Automata Theory and Applications. Third International Conference, LATA 2009, Tarragona, Spain, April 2 – 8, 2009. LNCS 5457, Springer, 2009, 588–600. RALF STIEBE, SHERZOD TURAEV, Capacity Bounded Grammars and Petri Nets. In: JÜRGEN DASSOW, GIOVANNI PIGHIZZINI, BIANCA TRUTHE (eds.), Eleventh International Workshop on Descriptional Complexity of Formal Systems. Magdeburg, Germany, July 6–9, 2009. Proceedings. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2009, 247–258. BIANCA TRUTHE, Target Based Accepting Networks of Evolutionary Processors with Regular Filters. In: HENNING BORDIHN, RUDOLPH FREUND, MARKUS HOLZER, MARTIN KUTRIB, FRIEDRICH OTTO (eds.), Workshop on Non-Classical Models of Automata and Applications (NCMA), Wrocław, Poland, August 31 – September 1, 2009, Proceedings. books@ocg.at 256, Österreichische Computer Gesellschaft, Austria, 2009, 221–236. BIANCA TRUTHE, Ziel basierte akzeptierende Netzwerke evolutionärer Prozessoren mit regulären Filtern. In: JÖRAN MIELKE, LUDWIG STAIGER, RENATE WINTER (eds.), Theorietag Automaten und Formale Sprachen 2009, Wittenberg, 27. bis 30. September 2009. Technical Report 2009/03, Martin-Luther-Universität Halle-Wittenberg, Institut für Informatik, 2009, 53–54. 2008 ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, GYÖRGY VASZIL, Some New Modes of Competence-Based Derivations. In: MASAMI ITO, MASAFUMI TOYAMA (eds.), Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16–19, 2008, Proceedings. LNCS 5257, Springer, 2008, 228–239. JÜRGEN DASSOW, GEMA M. MARTÍN, FRANCISCO J. VICO, Some Operations Preserving Primitivity of Words. In: Colloquium on the Occasion of the 50th Birthday of Victor Mitrana. Proceedings. Otto-von-Guericke-Universität Magdeburg, Germany, 2008, 11–28. JÜRGEN DASSOW, VICTOR MITRANA, Accepting Networks of Non-Inserting Evolutionary Processors. In: ION PETRE, GRZEGORZ ROZENBERG (eds.), Proceedings of NCGT 2008 – Workshop on Natural Computing and Graph Transformations, Leicester, United Kingdom, September 8, 2008. University of Leicester, 2008, 29–41. JÜRGEN DASSOW, BIANCA TRUTHE, On Two Hierarchies of Subregularly Tree Controlled Languages. In: CEZAR CÂMPEANU, GIOVANNI PIGHIZZINI (eds.), 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16–18, 2008, Proceedings. University of Prince Edward Island, 2008, 145–156. JÜRGEN DASSOW, BIANCA TRUTHE, Subregularly Tree Controlled Grammars and Languages. In: ERZSÉBET CSUHAJ-VARJÚ, ZOLTÁN ESIK (eds.), Automata and Formal Languages – 12th International Conference AFL 2008, Balatonfüred, Hungary, May 27–30, 2008, Proceedings. Computer and Automation Research Institute of the Hungarian Academy of Sciences, 2008, 158–169. JÜRGEN DASSOW, SHERZOD TURAEV, Arbitrary Petri Net Controlled Grammars. In: GEMMA BEL-ENGUIX, MARIA DOLORES JIMÉNEZ-LÓPEZ (eds.), Linguistics and Formal Languages. Proceedings of the Second International Workshop `Non-Classical Formal Languages in Linguistics' ForLing 2008, Tarragona, Spain, September 19 – 20, 2008. Universitat Rovira i Virgili, Tarragona, Spain, 2008, 27–39. JÜRGEN DASSOW, SHERZOD TURAEV, k-Petri Net Controlled Grammars. In: SZILÁRD ZSOLT FAZEKAS, CARLOS MARTÍN-VIDE, CRISTINA TÎRNAUCA (eds.), 2nd International Conference on Language and Automata Theory and Applications, LATA 2008, Tarragona, Spain, March 13 – 19, 2008, Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 36/08, Universitat Rovira i Virgili, Tarragona, Spain, 2008, 221–232. JÜRGEN DASSOW, SHERZOD TURAEV, k-Petri Net Controlled Grammars. In: CARLOS MARTÍN-VIDE, FRIEDRICH OTTO, HENNING FERNAU (eds.), Language and Automata Theory and Applications. Second International Conference, LATA 2008, Tarragona, Spain, March 13 – 19, 2008, Revised Papers. LNCS 5196, Springer, 2008, 209–220. HENNING FERNAU, RALF STIEBE, Blinde Zählerautomaten auf ω-Wörtern. In: MARKUS HOLZER, MARTIN KUTRIB, ANDREAS MALCHER (eds.), 18. Theorietag Automaten und Formale Sprachen, Wettenberg-Launsbach, 30. September – 2. Oktober 2008, Proceedings. Justus-Liebig-Universität Gießen, Germany, 2008, 45–48. RALF STIEBE, On the Complexity of the Control Language in Tree Controlled Grammars. In: Colloquium on the Occasion of the 50th Birthday of Victor Mitrana. Proceedings. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2008, 29–36. BIANCA TRUTHE, On Small Accepting Networks of Evolutionary Processors with Regular Filters. In: Colloquium on the Occasion of the 50th Birthday of Victor Mitrana. Proceedings. Otto-von-Guericke-Universität Magdeburg, Germany, 2008, 37–52. BIANCA TRUTHE, Zu akzeptierenden Netzwerken evolutionärer Prozessoren mit zwei Knotenarten. In: MARKUS HOLZER, MARTIN KUTRIB, ANDREAS MALCHER (eds.), 18. Theorietag Automaten und Formale Sprachen, Wettenberg-Launsbach, 30. September – 2. Oktober 2008, Proceedings. Justus-Liebig-Universität Gießen, Germany, 2008, 121–128. 2007 JÜRGEN DASSOW, HENNING FERNAU, Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. In: REMCO LOOS, SZILÁRD ZSOLT FAZEKAS, CARLOS MARTÍN-VIDE (eds.), 1st International Conference on Language and Automata Theory and Applications, LATA 2007, Tarragona, Spain, March 29 – April 4, 2007, Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili, Tarragona, Spain, 2007, 249–260. JÜRGEN DASSOW, RAFLF STIEBE, Nonterminal Complexity of Some Operations on Context-Free Languages. In: VILIAM GEFFERT, GIOVANNI PIGHIZZINI (eds.), 9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007, Novy Smokovec, Slovakia, July 20–23, 2007, Proceedings. University Kosice, Slovakia, 2007, 162–169. JÜRGEN DASSOW, BIANCA TRUTHE, On the Power of Networks of Evolutionary Processors. In: JÉRÔME DURAND-LOSE, MAURICE MARGENSTERN (eds.), Machines, Computations and Universality, MCU 2007, Orléans, France, September 10–13, 2007, Proceedings. LNCS 4664, Springer, 2007, 158–169. JÜRGEN DASSOW, BIANCA TRUTHE, Zur Mächtigkeit von Netzwerken evolutionärer Prozessoren mit zwei Knotenarten. In: MANFRED DROSTE, MARKUS LOHREY (eds.), 17. Theorietag Automaten und Formale Sprachen, Leipzig, 27.–29. September 2007, Proceedings. Universität Leipzig, 2007, 38–44. RALF STIEBE, Slender Siromoney Matrix Languages. In: REMCO LOOS, SZILÁRD ZSOLT FAZEKAS, CARLOS MARTÍN-VIDE (eds.), 1st International Conference on Language and Automata Theory and Applications, LATA 2007, Tarragona, Spain, March 29 – April 4, 2007, Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili, Tarragona, Spain, 2007, 553–564. BIANCA TRUTHE, Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements. In: VILIAM GEFFERT, GIOVANNI PIGHIZZINI (eds.), 9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007, Novy Smokovec, Slovakia, July 20–23, 2007, Proceedings. University Kosice, 2007, 141–152. 2006 JÜRGEN DASSOW, ERZSÉBET CSUHAJ-VARJÚ, On the syntactic complexity of Darwinian membrane systems. In: CARMEN GRACIANI DÍAZ, GHEORGHE PAUN, ALVARO ROMERO-JIMÉNEZ, FERNANDO SANCHO-CAPARRINI (eds.), Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30-February 3, 2006. RGNC Report 3, Fénix Editora, Sevilla University, 2006, 1–15. JÜRGEN DASSOW, BIANCA TRUTHE, Kontextfreie PC-Grammatiksysteme zum Erzeugen einer Sprache mit Verschränkung. In: RUDOLF FREUND, MARION OSWALD (eds.), 16. Theorietag Automaten und Formale Sprachen, Wien, 27.–29. September 2006, Proceedings. TU Wien, Austria, 2006, 40–45. JÜRGEN DASSOW, BIANCA TRUTHE, On the degree complexity of special non-context-free languages with respect to PC grammar systems. In: HING LEUNG, GIOVANNI PIGHIZZINI (eds.), 8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006, Las Cruces, NM, USA, June 21–23, 2006, Proceedings. Computer Science Technical Report NMSU-CS-2006-001, New Mexico State University Las Cruces, 2006, 241–249. JÜRGEN DASSOW, GYÖRGY VASZIL, Ciliate Bio-operations on Finite String Multisets. In: OSCAR H. IBARRA, ZHE DANG (eds.), Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26–29, 2006, Proceedings. LNCS 4036, Springer, 2006, 168–179. JÜRGEN DASSOW, GYÖRGY VASZIL, On the number of active symbols in Lindenmayer systems. In: HING LEUNG, GIOVANNI PIGHIZZINI (eds.), 8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006, Las Cruces, NM, USA, June 21–23, 2006, Proceedings. Computer Science Technical Report NMSU-CS-2006-001, New Mexico State University Las Cruces, 2006, 130–140. JÜRGEN DASSOW, GYÖRGY VASZIL, P Finite Automata and Regular Languages over Countably Infinite Alphabets. In: HENDRIK JAN HOOGEBOOM, GHEORGHE PAUN, GRZEGORZ ROZENBERG (eds.), 7th Workshop on Membrane Computing. At the Crossroads of Cell Biology and Computation WMC7, July 17–21, 2006, Pre-Proceedings. Lorentz Center, Leiden, 2006, 323–336. RALF STIEBE, On Transposable Siromoney Matrix Languages. In: RUDOLF FREUND, MARION OSWALD (eds.), 16. Theorietag Automaten und Formale Sprachen, Wien, 27.–29. September 2006, Proceedings. TU Wien, Austria, 2006, 110–112. 2005 BIANCA TRUTHE, A Method for Deciding the Finiteness of Synchronous, Tabled Picture Languages. In: ZOLTÁN ESIK, ZOLTÁN FÜLÖP (eds.), Automata and Formal Languages – 11th International Conference AFL 2005, Dobogókõ, Hungary, May 17–20, 2005, Proceedings. Institute of Informatics, University of Szeged, Hungary, 2005, 292–305. BIANCA TRUTHE, Äquivalenz von Bildsprachen synchroner deterministischer Ketten-Code-Bild-Systeme. In: HENNING FERNAU (ed.), 15. Theorietag Automaten und Formale Sprachen. Preprint WSI-2005-16, Universität Tübingen, 2005, 59–62. 2004 JÜRGEN DASSOW, A Ciliate Bio-operation and Language Families. In: CRISTIAN S. CALUDE, ELENA CALUDE, MICHAEL J. DINNEEN (eds.), Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13–17, 2004, Proceedings. LNCS 3340, Springer, 2004, 151–162. JÜRGEN DASSOW, On cooperating distributed grammar systems with competence based start and stop conditions. In: ERZSÉBET CSUHAJ-VARJÚ, GYÖRGY VASZIL (eds.), Proc. Grammar Systems Week 2004. MTA SZTAKI, Budapest, 2004, 158–169. JÜRGEN DASSOW, On the descriptional complexity of Lindenmayer systems. In: LUCIAN ILIE, HELMUT JÜRGENSEN, DETLEF WOTSCHKE (eds.), Proc. 6th International Workshop on Descriptional Complexity of Formal Systems. Report 619, University of Western Ontario, 2004, 28–36. RALF STIEBE, Subimage Problems for Siromoney Matrix Languages. In: SUNA BENSCH, OLIVER BOLDT, HENNING BORDIHN, HELMUT JÜRGENSEN (eds.), 14. Theorietag Automaten und Formale Sprachen. Institut für Informatik, Universität Potsdam, 2004, 123–127. BIANCA TRUTHE, A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages. In: CRISTIAN S. CALUDE, ELENA CALUDE, MICHAEL J. DINNEEN (eds.), Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13–17, 2004, Proceedings. LNCS 3340, Springer, 2004, 406–417. BIANCA TRUTHE, Zur Endlichkeit von Bildsprachen zu tabellierten Ketten-Code-Bild-Systemen. In: SUNA BENSCH, OLIVER BOLDT, HENNING BORDIHN, HELMUT JÜRGENSEN (eds.), 14. Theorietag Automaten und Formale Sprachen. Preprint 2/2004, Institut für Informatik, Universität Potsdam, 2004, 135–139. 2003 KLAUS BENECKE, Algebraische Spezifikation von XML-Dokumenten. In: KLAUS P. JANTKE, WOLFGANG S. WITTIG, JÖRG HERRMANN (eds.), Von e-Learning bis e-Payment 2003. Tagungsband LIT 2003, Leipziger Informatiktage. Akademische Verlagsgesellschaft Aka GmbH, Berlin, 2003, 56–66. KLAUS BENECKE, Assignments for XML-Documents. In: Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Education, Science, Medicine and Mobile Technologies on the Internet (SSGRR 2003w). 2003, 1–7. KLAUS BENECKE, otto – A Computer Language for the General School. In: Proceedings VIP-IPSI-Computer Science Conference. 2003, 1–9. JÜRGEN DASSOW, On the Differentiation Function of some Language Generating Devices. In: MASAMI ITO, TERUO IMAOKA (eds.), Words, Languages and Combinatorics III – Proceedings of the Third International Conference, Kyoto, Japan, March 14–18, 2000. World Scientific, 2003, 151–161. JÜRGEN DASSOW, TAISHIN Y. NISHIDA, BERND REICHEL, On the Descriptional Complexity of some Variants of Lindenmayer Systems. In: MASAMI ITO, MASAFUMI TOYAMA (eds.), Developments in Language Theory – 6th International Conference, DLT 2002, Kyoto, Japan, September 18–21, 2002, revised papers. LNCS 2450, Springer, Berlin, 2003, 128–139. RALF STIEBE, Positive valence grammars. In: ERZSÉBET CSUHAJ-VARJÚ, CHANDRA M. R. KINTALA, DETLEF WOTSCHKE, GYÖRGY VASZIL (eds.), Descriptional Complexity of Formal Systems. MTA SZTAKI, Budapest, 2003, 186–197. 2002 KLAUS BENECKE, Stroke – A Powerful Tool for XML-like Data. In: Proc. 6th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2002). 2002, 273–278. HENNING FERNAU, RALF STIEBE, Valuated and Valence Grammars: an Algebraic View. In: WERNER KUICH (ed.), Developments in Language Theory, DLT 2001. Springer, 2002, 281–292. 2001 KLAUS BENECKE, Remarks to Step by Step Application of Operations. In: MARTIN ENDIG, THOMAS HERSTEL (eds.), Tagungsband zum 13. GI-Workshop `Grundlagen von Datenbanken', Gommern 5.–8. Juni 2001. Technischer Bericht 10/2001, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2001, 8–12. RALF STIEBE, Positive Valence Grammars. In: JÜRGEN DASSOW, BERND REICHEL (eds.), 11. Theorietag Automaten und Formale Sprachen. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2001, 103–106. 2000 HENNING BORDIHN, On the number of active symbols in L and CD grammar systems. In: RUDOLF FREUND (ed.), Theorietag 2000 mit Workshop New Computing Paradigms: Molecular Computing and Quantum Computing (Wien, Österreich). Technische Universität Wien, Institut für Computersprachen, 2000, 175–176. HENNING BORDIHN, MARKUS HOLZER, Cooperating distributed grammar systems with non-terminating components. In: GRZEGORZ ROZENBERG, WOLFGANG THOMAS (eds.), Developments in Language Theory. World Scientific, 2000, 305–315. HENNING BORDIHN, MARKUS HOLZER, On the number of active symbols in L and CD grammar systems. In: OLIVER BOLDT, HELMUT JÜRGENSEN (eds.), Pre-Proceedings of DCAGRS 2000, Descriptional Complexity of Automata, Grammars and Related Structures (London/Ontario 2000). Report 555/2000, Department of Computer Science, The University of Western Ontario, 2000, 30–43. BERND REICHEL, A Remark on the Succinctness of Descriptions of Context-Free Languages by Cooperating Distributed Grammar Systems. In: RUDOLF FREUND (ed.), Theorietag 2000 mit Workshop New Computing Paradigms: Molecular Computing and Quantum Computing (Wien, Österreich). Technische Universität Wien, Institut für Computersprachen, 2000, 199–200. RALF STIEBE, Slender matrix languages. In: GRZEGORZ ROZENBERG, WOLFGANG THOMAS (eds.), Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6–9 July 1999. World Scientific, 2000, 375–385. 1999 HENNING BORDIHN, JÜRGEN DASSOW, MARKUS HOLZER, H-Ausdrücke – eine Erweiterung regulärer Ausdrücke. In: FRIEDRICH OTTO, GUNDULA NIEMANN (eds.), 9. Theorietag Automaten und Formale Sprachen. Mathematische Schriften Kassel 12/1999, Universität Gesamthochschule Kassel, Fachbereich Mathematik/Informatik, 1999, 57–58. HENNING BORDIHN, JÜRGEN DASSOW, GYÖRGY VASZIL, Grammar Systems as Language Analyzers and Recursively Enumerable Languages. In: GABRIEL CIOBANU, GHEORGHE PAUN (eds.), Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 – September 3, 1999, Proceedings. LNCS 1684, Springer, 1999, 136–147. HENNING BORDIHN, HENNING FERNAU, MARKUS HOLZER, Accepting Pure Grammars. In: PÁL DÖMÖSI (ed.), 9th International Conference on Automata and Formal Languages (Preproceedings), Vasszécseny, Hungary. 1999, 1–3. BIANCA TRUTHE, Zur Endlichkeit von Bildsprachen synchroner, deterministischer Ketten-Code-Bild-Systeme. In: FRIEDRICH OTTO, GUNDULA NIEMANN (eds.), 9. Theorietag Automaten und Formale Sprachen. Mathematische Schriften Kassel 12/1999, Universität Gesamthochschule Kassel, Fachbereich Mathematik/Informatik, 1999, 57–58. 1998 HENNING BORDIHN, Cooperating/distributed grammar systems – various different points of view. In: HOLGER PETERSEN (ed.), Workshop on Formal Languages, Automata and Petri-Nets (Stuttgart 1998). Report 1998/01, Universität Stuttgart, Fakultät für Informatik, 1998, 3–3. JÜRGEN DASSOW, Some remarks on extended regular languages. In: SYMEON BOZAPALIDIS (ed.), Proc. 3rd Internat. Conf. Developments in Language Theory. Aristotle University of Thessaloniki, 1998, 477–488. JÜRGEN DASSOW, Some remarks on networks of parallel language processors. In: LECH POLKOWSKI, ANDRZEJ SKOWRON (eds.), Rough Sets and Current Trends in Computing, 1. RSCTC'98, Warsaw, Poland, June 22-26, 1998, Proceedings. LNCS 1424, Springer-Verlag, 1998, 83–90. JÜRGEN DASSOW, VICTOR MITRANA, The degree of parallelism in contextual grammars with the minimal competence strategy. In: CARLOS MARTÍN-VIDE (ed.), Mathematical and Computational Analysis of Natural Languages. John Benjamins Publ. Co., 1998, 3–16. JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PAUN, Point mutations in context-free languages. In: SYMEON BOZAPALIDIS (ed.), Proc. 3rd Internat. Conf. Developments in Language Theory. Aristotle University of Thessaloniki, 1998, 429–446. 1997 JÜRGEN DASSOW, VICTOR MITRANA, Evolutionary grammars: a grammatical model for genome evolution. In: RALF HOFESTÄDT, THOMAS LENGAUER, MARKUS LÖFFLER, DIETMAR SCHOMBURG (eds.), Proc. First German Conference on Bioinformatics. LNCS 1278, Springer-Verlag, 1997, 199–209. JÜRGEN DASSOW, VICTOR MITRANA, On some operations suggested by genome evolution. In: RUSS B. ALTMAN, A. KEITH DUNKER, LAWRENCE HUNTER, TERI K. KLEIN (eds.), Pacific Symposium on Biocomputing'97. World Scientific, 1997, 97–108. HENNING FERNAU, RALF STIEBE, Regulations by Valences. In: IGOR PRÍVARA, PETER RUZICKA (eds.), Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25–29, 1997, Proceedings. LNCS 1295, Springer, 1997, 239–248. 1996 HENNING BORDIHN, HENNING FERNAU, Accepting grammars and systems: An overview. In: JÜRGEN DASSOW, GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Developments in Language Theory II. World Scientific, 1996, 199–208. JÜRGEN DASSOW, ANNEGRET HABEL, STEFAN TAUBENBERGER, Chain-code pictures and collages generated by hyperedge replacement. In: JANICE E. CUNY, HARTMUT EHRIG, GREGOR ENGELS, GRZEGORZ ROZENBERG (eds.), Graph Grammars and Their Application to Computer Science. LNCS 1073, Springer, 1996, 412–427. RALF STIEBE, Some New Decision Results for Edge Grammars. In: JÜRGEN DASSOW, GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17–21 July 1995. World Scientific, 1996, 329–338. 1995 HENNING BORDIHN, HENNING FERNAU, Accepting programmed grammars without nonterminals. In: MARTIN KUTRIB, THOMAS WORSCH (eds.), 5. GI Theorietag `Automaten und Formale Sprachen' (Schloß Rauischholzhausen 1995). Bericht 9503, Arbeitsgruppe Informatik, Universität Gießen, 1995, 4–16. HENNING FERNAU, HENNING BORDIHN, Programmierte Grammatiken und limitierte L Systeme als Sprachakzeptoren. In: MARKUS HOLZER (ed.), 4. GI Theorietag `Automaten und Formale Sprachen' (Herrsching 1994). Preprint WSI-95-10, Wilhelm-Schickard-Institut, Universität Tübingen, 1995, 21–24. 1994 HENNING BORDIHN, On the degree of nondeterminism. In: JÜRGEN DASSOW, ALICA KELEMENOVA (eds.), Developments in Theoretical Computer Science. Gordon and Breach Science Publishers, 1994, 133–140. HENNING BORDIHN, JÜRGEN DASSOW, A note on the degree of nondeterminism. In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Developments in Language Theory. World Scientific, 1994, 70–80. JÜRGEN DASSOW, Decision problems for edge grammars. In: IGOR PRÍVARA, BRANISLAV ROVAN, PETER RUZICKA (eds.), Proc. Mathematical Foundations of Computer Science '94. LNCS 841, Springer-Verlag, 1994, 286–295. JÜRGEN DASSOW, HOLGER HORNIG, Conditional grammars with subregular conditions. In: MASAMI ITO, HELMUT JÜRGENSEN (eds.), Proc. Intern. Conf. Words, Languages and Combinatorics II. World Scientific, 1994, 71–86. JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PAUN, Iterative reading of numbers: The ordered case. In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Developments in Language Theory. World Scientific, 1994, 157–168. GHEORGHE PAUN, JÜRGEN DASSOW, STEFAN SKALLA, On the size of components of cooperating grammars. In: JUHANI KARHUMÄKI, HERRMANN A. MAURER, GRZEGORZ ROZENBERG (eds.), Results and Trends in Computer Science. LNCS 812, Springer, 1994, 325–343. BERND REICHEL, Eine Bemerkung über Linksableitung indisch paralleler Grammatiken. In: VOLKER DIEKERT, DAN TEODOSIU (eds.), 3. Theorietag `Automaten und Formale Sprachen' (Schloß Dagstuhl, 7./8. Oktober 1993). Technischer Bericht 1/94, Universität Stuttgart, Fakultät für Informatik, 1994, 50–51. STEFAN SKALLA, Zur Anzahl der aktiven Nichtterminale in kooperierenden Grammatiksystemen. In: VOLKER DIEKERT, DAN TEODOSIU (eds.), 3. Theorietag `Automaten und Formale Sprachen' (Schloß Dagstuhl, 7./8. Oktober 1993). Technischer Bericht 1/94, Universität Stuttgart, Fakultät für Informatik, 1994, 56–57. 1993 JÜRGEN DASSOW, On the power of cooperation in distributed grammer systems. In: GABRIEL CIOBANU, VICTOR FELEA (eds.), Proc. 9th Romanian Symposium on Computer Science, Iasi. 1993, 12–23. 1991 JÜRGEN DASSOW, KLAUS-JÖRN LANGE, Computational complexity and hardest languages of automata with abstract storages. In: LOTHAR BUDACH (ed.), Proc. Fundamentals of Computation Theory '91. LNCS 529, Springer-Verlag, 1991, 200–209. 1990 RALF STIEBE, Picture Generation Using Matrix Systems. In: JÜRGEN DASSOW, JOZEF KELEMEN (eds.), Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19–23, 1990, Proceedings. LNCS 464, Springer, 1990, 251–260. 1989 JÜRGEN DASSOW, JURAJ HROMKOVIC, JUHANI KARHUMÄKI, BRANISLAV ROVAN, ANNA SLOBODOVÁ, On the power of synchronization in parallel computations. In: ANTONI KRECZMAR, GRAZYNA MIRKOWSKA (eds.), Proc. Mathematical Foundations of Computer Science. LNCS 379, Springer-Verlag, 1989, 196–206. 1988 HENNING BORDIHN, On some deterministic grammars with regulation. In: ERZSÉBET CSUHAJ-VARJÚ, JÁNOS DEMETROVICS, JOZEF KELEMEN (eds.), Proceedings of the 5. Intern. Meeting of Young Computer Scientists (IMYCS'88). Computer and Automation Institute, Hungarian Academy of Sciences, 1988, 87–93. 1987 JÜRGEN DASSOW, HELMUT JÜRGENSEN, Soliton automata. In: RAIS G. BUCHARAEV, LOTHAR BUDACH, OLEG B. LUPANOV (eds.), Proc. Fundamentals of Computation Theory '87. LNCS 278, Springer-Verlag, 1987, 95–102. 1985 JÜRGEN DASSOW, Comparison of some types of regulated rewriting. In: JÁNOS DEMETROVICS, LOTHAR BUDACH, ARTO SALOMAA (eds.), Proc. Conf. Algebra, Combinatorics, and Logics in Computer Science (Colloq. Math. Soc. Janos Bolyai 42). North-Holland, 1985, 301–303. 1984 JÜRGEN DASSOW, On deterministic random context L systems. In: GERD WECHSUNG (ed.), Proc. 2nd Frege Conference (Math. Forschung 20). Akademie-Verlag, 1984, 309–314. JÜRGEN DASSOW, GHEORGHE PAUN, On the description of languages by grammars with regulated rewriting. In: JÁNOS DEMETROVICS, JOZEF KELEMEN (eds.), Proc. Intern. Meeting of Young Computer Scientists '84. Computer and Automation Institute, Hungarian Academy of Sciences, Tanulmanyok 158/1984, 1984, 15–21. 1981 JÜRGEN DASSOW, Equality languages and language families. In: BÉLA CSAKANY, JÁNOS DEMETROVICS (eds.), Proc. Fundamentals of Computation Theory '81. LNCS 118, Springer-Verlag, 1981, 100–109. 1979 JÜRGEN DASSOW, On the congruence lattice of algebras of automaton mappings. In: BÉLA CSAKANY (ed.), Proc. Finite Algebras & Multi-Valued Logics (Colloq. Math. Soc. Janos Bolyai 28) . North-Holland, 1979, 161–182. 1978 JÜRGEN DASSOW, Some remarks on the algebra of automata. In: Proc. 4th Winter School Operating Systems (Tanulmanyok 87/1978). Computer and Automation Institute, Hungarian Academy of Sciences, 1978, 71–77. 1977 JÜRGEN DASSOW, Some remarks on the algebra of automaton mappings. In: MAREK KARPINSKI (ed.), Proc. Fundamentals of Computation Theory '77. LNCS 56, Springer-Verlag, 1977, 78–85.