Publications of the Research Group "Formal Languages and Automata"

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

2020  

  JÜRGEN DASSOW:
Lindenmayer Systems with Control by Ideals and Codes.
Journal of Automata, Languages and Combinatorics 25 (2020) 1, 3–20.

  JÜRGEN DASSOW, BIANCA TRUTHE:
Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters.
Journal of Automata, Languages and Combinatorics 25 (2020) 2–3, 83–113.

  JÜRGEN DASSOW, BIANCA TRUTHE:
Networks with Evolutionary Processors and Ideals and Codes as Filters.
International Journal of Foundations in Computer Science 31 (2020) 1, 73–89.

  CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 11th International Conference on Language and Automata Theory and Applications (LATA 2017).
Information and Computation  , 2020. In preparation.

  CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 12th International Conference on Language and Automata Theory and Applications (LATA 2018).
Information and Computation  , 2020. In preparation.

  CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 13th International Conference on Language and Automata Theory and Applications (LATA 2019).
Information and Computation  , 2020. In preparation.

  CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 14th International Conference on Language and Automata Theory and Applications (LATA 2020).
Information and Computation  , 2020. In preparation.

  BIANCA TRUTHE:
Generative Capacity of Contextual Grammars with Subregular Selection Languages.
Fundamenta Informaticae (2020). Submitted.

2019  

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 10th International Conference on Language and Automata Theory and Applications (LATA 2016).
Information and Computation 269, 2019.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 9th International Conference on Language and Automata Theory and Applications (LATA 2015).
Journal of Computer and System Sciences 104, 2019.

  BIANCA TRUTHE:
Accepting Networks of Evolutionary Processors with Resources Restricted Filters.
In: RUDOLF FREUND, MARKUS HOLZER, JOSÉ M. SEMPERE (eds.), 11th Workshop on Non-Classical Models of Automata and Applications (NCMA), Valencia, Spain, July 2–3, 2019, Proceedings. books@ocg.at 336, Österreichische Computer Gesellschaft, Austria, 2019, 187–202.

  BIANCA TRUTHE:
Accepting Networks of Evolutionary Processors with Resources Restricted Filters.
In: SEBASTIAN MANETH (ed.), 29. Theorietag `Automaten und Formale Sprachen', Bremen, 25.–27. September 2019. Technischer Bericht der AG Datenbanken, Universität Bremen, 2019, 28–31.

2018  

  JÜRGEN DASSOW:
Grammars with control by ideals and codes.
Journal of Automata, Languages and Combinatorics 23 (2018) 1–3, 143–164.

  JÜRGEN DASSOW:
Kuratowski's Complement-Closure Theorem and the Orbit of Closure-Involution Operations.
In: KLAUS REINHARDT, LUDWIG STAIGER, RENATE WINTER (eds.), 28. Theorietag `Automaten und Formale Sprachen', Wittenberg, 24.–27. September 2018. Technischer Bericht 18-1, Martin-Luther-Universität Halle-Wittenberg, 2018, 74–77.

  MARKUS HOLZER, BIANCA TRUTHE, AHMAD FIRDAUS YOSMAN:
On Bonded Sequential and Parallel Insertion Systems.
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 52 (2018) 2–4, 127–151.

  BIANCA TRUTHE:
Networks of Evolutionary Processors with Resources Restricted Filters.
In: RUDOLF FREUND, MICHAL HOSPODÁR, GALINA JIRASKOVÁ, GIOVANNI PIGHIZZINI (eds.), 10th Workshop on Non-Classical Models of Automata and Applications (NCMA), Košice, Slovakia, August 21–22, 2018. Proceedings. books@ocg.at 332, Österreichische Computer Gesellschaft, Austria, 2018, 165–180.

  BIANCA TRUTHE:
Networks of Evolutionary Processors with Resources Restricted Filters.
In: KLAUS REINHARDT, LUDWIG STAIGER, RENATE WINTER (eds.), 28. Theorietag `Automaten und Formale Sprachen', Wittenberg, 24.–27. September 2018. Technischer Bericht 18-1, Martin-Luther-Universität Halle-Wittenberg, 2018, 78–81.

2017  

  JÜRGEN DASSOW:
Descriptional Complexity and Operations – Two Non-classical Cases.
In: GIOVANNI PIGHIZZINI, CEZAR CÂMPEANU (eds.), Descriptional Complexity of Formal Systems – 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3–5, 2017. Proceedings. Lecture Notes in Computer Science 10316, Springer, 2017, 33–44.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 8th International Conference on Language and Automata Theory and Applications (LATA 2014).
Information and Computation 253, 2017.

  FRANK DREWES, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Language and Automata Theory and Applications – 11th International Conference, LATA 2017, Umeå, Sweden, March 6–9, 2017, Proceedings.
LNCS 10168, Springer, 2017.

  FLORIN MANEA, BIANCA TRUTHE, GYÖRGY VASZIL (eds.):
TCS Special Issue on Languages and Combinatorics in Theory and Nature Dedicated to Jürgen Dassow.
Theoretical Computer Science 682, 2017.

  BIANCA TRUTHE:
Hierarchies of Language Families of Contextual Grammars.
In: RUDOLF FREUND, FRANTISEK MRÁZ, DANIEL PRŮSA (eds.), 9th Workshop on Non-Classical Models of Automata and Applications (NCMA), Prague, Czech Republic, August 17–18, 2017. Proceedings. books@ocg.at 329, Österreichische Computer Gesellschaft, Austria, 2017, 13–28.

  AHMAD FIRDAUS YOSMAN, MARKUS HOLZER, BIANCA TRUTHE, WAN HENG FONG, SHERZOD TURAEV:
On bonded indian and uniformly parallel insertion systems and their generative power.
Malaysian Journal of Fundamental and Applied Sciences 13 (2017) 4, 769–773.

2016  

  JÜRGEN DASSOW:
On the Number of Accepting States of Finite Automata.
Journal of Automata, Languages and Combinatorics 21 (2016) 1–2, 55–67.

  JÜRGEN DASSOW:
On the Number of Accepting States of Finite Automata.
In: FLORIN MANEA, DIRK NOWOTKA, THOMAS WILKE (eds.), 26. Theorietag `Automaten und Formale Sprachen', Aukrug, 4.–7. Oktober 2016. Berichte Institut für Informatik 1606, Christian-Albrechts-Universität zu Kiel, 2016, 23–26.

  ADRIAN HORIA DEDIU, JAN JANOUŠEK, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Language and Automata Theory and Applications – 10th International Conference, LATA 2016, Prague, Czech Republic, March 14–18, 2016. Proceedings.
LNCS 9618, Springer, 2016.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 7th International Conference on Language and Automata Theory and Applications (LATA 2013).
Information and Computation 246, 2016.

  WAN HENG FONG, MARKUS HOLZER, BIANCA TRUTHE, SHERZOD TURAEV, AHMAD FIRDAUS YOSMAN:
On Bonded Sequential and Parallel Insertion Systems.
In: HENNING BORDIHN, RUDOLF FREUND, BENEDEK NAGY, GYöRGY VASZIL (eds.), 8th Workshop on Non-Classical Models of Automata and Applications (NCMA), Debrecen, Hungary, August 29–30, 2016, Proceedings. books@ocg.at 321, Österreichische Computer Gesellschaft, Austria, 2016, 163–178.

  WAN HENG FONG, MARKUS HOLZER, BIANCA TRUTHE, SHERZOD TURAEV, AHMAD FIRDAUS YOSMAN:
On Bonded Sequential and Parallel Insertion Systems.
In: FLORIN MANEA, DIRK NOWOTKA, THOMAS WILKE (eds.), 26. Theorietag `Automaten und Formale Sprachen', Aukrug, 4.–7. Oktober 2016. Berichte Institut für Informatik 1606, Christian-Albrechts-Universität zu Kiel, 2016, 45–48.

  MARKUS HOLZER, MARTIN KUTRIB, BIANCA TRUTHE:
Editorial.
Journal of Automata, Languages and Combinatorics 21 (2016) 1–2, 3–4.

  MARKUS HOLZER, MARTIN KUTRIB, BIANCA TRUTHE:
Preface.
Journal of Automata, Languages and Combinatorics 21 (2016) 1–2, 5–6.

  MARKUS HOLZER, MARTIN KUTRIB, BIANCA TRUTHE (eds.):
Special Issues Dedicated to Rudolf Freund.
Journal of Automata, Languages and Combinatorics 21 (1–2), 2016.

  AHMAD FIRDAUS YOSMAN, MARKUS HOLZER, BIANCA TRUTHE, WAN HENG FONG, SHERZOD TURAEV:
Two Variants of Bonded Parallel Insertion Systems and Their Generative Power.
In: 6th International Graduate Conference on Engineering, Science, and Humanities (IGCESH), Johor Bahru, Malaysia, 15-–17 August 2016, Proceedings. Universiti Teknologi Malaysia, Johor Bahru, Malaysia, 2016, 418–420.

2015  

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.
Fundamenta Informaticae 136 (2015) 1–2, 1–35.

  JÜRGEN DASSOW, STEFAN RUDOLF:
Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case.
Acta Cybernetica 22 (2015) 2, 313–334.

  ADRIAN HORIA DEDIU, ENRICO FORMENTI, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Language and Automata Theory and Applications – 9th International Conference, LATA 2015, Nice, France, March 2–6, 2015. Proceedings.
LNCS 8977, Springer, 2015.

  MARKUS HOLZER, BIANCA TRUTHE:
On relations between some subregular language families.
In: RUDOLF FREUND, MARKUS HOLZER, NELMA MOREIRA, ROGÉRIO REIS (eds.), 7th Workshop on Non-Classical Models of Automata and Applications (NCMA), Porto, Portugal, August 31 – September 1, 2015, Proceedings. books@ocg.at 318, Österreichische Computer Gesellschaft, Austria, 2015, 109–124.

  MARKUS HOLZER, BIANCA TRUTHE:
Zu Beziehungen zwischen subregulären Sprachfamilien.
In: HENNING FERNAU (ed.), 25. Theorietag `Automaten und Formale Sprachen', Speyer, 29. September – 2. Oktober 2015. Technical Reports Mathematics/Computer Science Technical Report No. 15-1, Universität Trier, 2015, 67–70.

2014  

  HENNING BORDIHN, BIANCA TRUTHE (eds.):
24. Theorietag `Automaten und Formale Sprachen', Caputh, 23.–25. September 2014.
Berichte Institut für Informatik und Computational Science TR-2014-2, Universität Potsdam, 2014.

  JÜRGEN DASSOW:
Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources.
In: CRISTIAN S. CALUDE, RUSINŠ FREIVALDS, IWAMA KAZUO (eds.), Computing with New Resources – Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. LNCS 8808, Springer, 2014, 292–306.

  JÜRGEN DASSOW:
Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources.
In: HENNING BORDIHN, BIANCA TRUTHE (eds.), 24. Theorietag `Automaten und Formale Sprachen', Caputh, 23.–25. September 2014. Berichte Institut für Informatik und Computational Science TR-2014-2, Universität Potsdam, 2014, 29–32.

  JÜRGEN DASSOW:
Restarting Automata with Subregular Constraints.
In: GHEORGHE PĂUN, GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Discrete Mathematics and Computer Science. Editura Academiei Române, 2014, 103–118.

  JÜRGEN DASSOW, FLORIN MANEA, ROBERT MERCAS:
Regular languages of partial words.
Information Sciences 268 (2014), 290–304.

  JÜRGEN DASSOW, FLORIN MANEA, ROBERT MERCAS, MIKE MÜLLER:
Inner Palindromic Closure.
International Journal of Foundations in Computer Science 25 (2014) 8, 1049–1064.

  JÜRGEN DASSOW, STEFAN RUDOLF:
Conditional Lindenmayer Systems with Subregular Conditions: The Non-Extended Case.
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 48 (2014) 1, 127–147.

  JÜRGEN DASSOW, JOZEF KELEMEN, GHEORGHE PĂUN (eds.):
Special Issue: Dedicated to Erzsébet Csuhaj-Varjú .
Journal of Automata, Languages and Combinatorics 19 (1–4), 2014.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, JOSÉ-LUIS SIERRA-RODRÍGUEZ, BIANCA TRUTHE (eds.):
Algorithms for Computational Biology – 1st International Conference, AlCoB 2014, Tarragona, Spain, July 1–-3, 2014. Proceedings..
LNCS 8542, Springer, 2014.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, JOSÉ-LUIS SIERRA-RODRÍGUEZ, BIANCA TRUTHE (eds.):
Language and Automata Theory and Applications – 8th International Conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings.
LNCS 8370, Springer, 2014.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 1st International Conference on Theory and Practice of Natural Computing (TPNC 2012).
Parallel Processing Letters 24, 2014.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 6th International Conference on Language and Automata Theory and Applications (LATA 2012).
Information and Computation 239, 2014.

  MARKUS HOLZER, BIANCA TRUTHE (eds.):
Special Issue: 4th Workshop on Non-Classical Models of Automata and Applications (NCMA 2012).
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 48, 2014.

  FLORIN MANEA, BIANCA TRUTHE:
Accepting Networks of Evolutionary Processors with Subregular Filters.
Theory of Computing Systems 55 (2014) 1, 84–109.

  BIANCA TRUTHE:
A Relation Between Definite and Ordered Finite Automata.
In: SUNA BESCH, RUDOLF FREUND, FRIEDRICH OTTO (eds.), 6th Workshop on Non-Classical Models of Automata and Applications (NCMA), Kassel, Germany, July 28–29, 2014, Proceedings. books@ocg.at 304, Österreichische Computer Gesellschaft, Austria, 2014, 235–247.

  BIANCA TRUTHE:
A Relation Between Definite and Ordered Finite Automata.
In: HENNING BORDIHN, BIANCA TRUTHE (eds.), 24. Theorietag `Automaten und Formale Sprachen', Caputh, 23.–25. September 2014. Berichte Institut für Informatik und Computational Science TR-2014-2, Universität Potsdam, 2014, 89–92.

2013  

  FERNANDO ARROYO, JUAN CASTELLANOS, JÜRGEN DASSOW, VICTOR MITRANA, JOSÉ-RAMÓN SÁNCHEZ-COUSO:
Accepting Splicing Systems with Permitting and Forbidding Words.
Acta Informatica 50 (2013) 1, 1–14.

  JÜRGEN DASSOW, FLORIN MANEA, ROBERT MERCAS, MIKE MÜLLER:
Inner Palindromic Closure.
In: MARIE-PIERRE BÉAL, OLIVIER CARTON (eds.), Developments in Language Theory. 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013, Proceedings. LNCS 7907, Springer, 2013, 155–166.

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
Networks of Evolutionary Processors: The Power of Subregular Filters.
Acta Informatica 50 (2013) 1, 41–75.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, RUSLAN MITKOV, BIANCA TRUTHE (eds.):
Statistical Language and Speech Processing – 1st International Conference, SLSP 2013, Tarragona, Spain, July 29–31, 2013. Proceedings.
LNCS 7978, Springer, 2013.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE (eds.):
Language and Automata Theory and Applications – 7th International Conference, LATA 2013, Bilbao, Spain, April 2–5, 2013. Proceedings.
LNCS 7810, Springer, 2013.

  ADRIAN HORIA DEDIU, CARLOS MARTÍN-VIDE, BIANCA TRUTHE, MIGUEL A. VEGA-RODRÍGUEZ (eds.):
Theory and Practice of Natural Computing – 2nd International Conference, TPNC 2013, Cáceres, Spain, December 3–5, 2013, Proceedings.
LNCS 8273, Springer, 2013.

  BIANCA TRUTHE:
Chains of Evolutionary Processors with Random Context Filters.
In: SUNA BESCH, FRANK DREWES, RUDOLF FREUND, FRIEDRICH OTTO (eds.), Fifth Workshop on Non-Classical Models of Automata and Applications (NCMA), Umeå, Sweden, August 13–14, 2013, Proceedings. books@ocg.at 294, Österreichische Computer Gesellschaft, Austria, 2013, 225–241.

  BIANCA TRUTHE:
Ketten evolutionärer Prozessoren mit Random-Context-Filtern.
In: DIETRICH KUSKE (ed.), 23. Theorietag `Automaten und Formale Sprachen', Ilmenau, Germany, September 25–27, 2013. Proceedings. Technische Universität Ilmenau, 2013, 14–16.

2012  

  HENNING BORDIHN, MARTIN KUTRIB, BIANCA TRUTHE (eds.):
Languages Alive – Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday.
LNCS 7300, Springer, 2012.

  JÜRGEN DASSOW:
Subregular Restrictions for Some Language Generating Devices.
In: RUDOLF FREUND, MARKUS HOLZER, BIANCA TRUTHE, ULRICH ULTES-NITSCHE (eds.), Fourth Workshop on Non-Classical Models of Automata and Applications (NCMA), Fribourg, Switzerland, August 23–24, 2012, Proceedings. books@ocg.at 290, Österreichische Computer Gesellschaft, Austria, 2012, 11–26.

  JÜRGEN DASSOW, RONNY HARBICH:
Production Complexity of Some Operations on Context-Free Languages.
In: MARTIN KUTRIB, NELMA MOREIRA, ROGÉRIO REIS (eds.), 14th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2012, Braga, Portugal, July 23–25, 2012, Proceedings. LNCS 7386, Springer, 2012, 141–154.

  JÜRGEN DASSOW, MARTIN KUTRIB, NELMA MOREIRA, ROGÉRIO REIS (eds.):
Selected Papers of the 11th Workshop on Descriptional Complexity of Formal Systems, DCFS 2012 (Braga, Portugal, July 23 – 25, 2012).
Journal of Automata, Languages and Combinatorics 17/2–4, 2012.

  JÜRGEN DASSOW, FLORIN MANEA, ROBERT MERCAS:
Connecting Partial Words and Regular Laguages.
In: SBARRY COOPER, ANUJ DAWAR, BENEDIKT LÖWE (eds.), How the World Computes – Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18–23, 2012. Proceedings. LNCS 7318, Springer, 2012, 151–161.

  JÜRGEN DASSOW, FLORIN MANEA, ROBERT MERCAS:
Connecting Partial Words and Regular Laguages.
In: FRANTIŠEK MRÁZ (ed.), 22nd Theorietag `Automata and Formal Languages', Prague, Czech Republic, October 3–5, 2012. Proceedings. Charles University in Prague, Fakulty of Mathematics and Physics, 2012, 45–50.

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
Generating Networks of Splicing Processors.
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 46 (2012) 4, 547–572.

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
Networks of Evolutionary Processors: Computationally Complete Normal Forms.
Natural Computing 11 (2012) 4, 595–607.

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
On External Contextual Grammars with Subregular Selection Languages.
Theoretical Computer Science 449 (2012) 1, 64–73.

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
On Subregular Selection Languages in Internal Contextual Grammars.
Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 145–164.

  JÜRGEN DASSOW, TOMÁŠ MASOPUST:
On restricted context-free grammars.
Journal of Computer and System Sciences 78 (2012) 1, 293–304.

  JÜRGEN DASSOW, GAIRATZHAN MAVLANKULOV, MOHAMED OTHMAN, SHERZOD TURAEV, MOHD HASAN SELAMAT, RALF STIEBE:
Grammars Controlled by Petri Nets.
In: PAWEL PAWLEWSKI (ed.), Petri Nets – Manufacturing and Computer Science. InTech, 2012, Chapter 15.

  JÜRGEN DASSOW, BIANCA TRUTHE:
Extended Splicing Systems with Subregular Sets of Splicing Rules.
In: RUDOLF FREUND, MARKUS HOLZER, BIANCA TRUTHE, ULRICH ULTES-NITSCHE (eds.), Fourth Workshop on Non-Classical Models of Automata and Applications (NCMA), Fribourg, Switzerland, August 23–24, 2012, Proceedings. books@ocg.at 290, Österreichische Computer Gesellschaft, Austria, 2012, 65–78.

  ADRIAN-HORIA DEDIU, CARLOS MARTIN-VIDE, BIANCA TRUTHE (eds.):
Theory and Practice of Natural Computing. First International Conference, TPNC 2012, Tarragona, Spain, October 2–4, 2012. Proceedings..
LNCS 7505, 2012.

  RUDOLF FREUND, MARKUS HOLZER, BIANCA TRUTHE, ULRICH ULTES-NITSCHE (eds.):
Fourth Workshop on Non-Classical Models of Automata and Applications (NCMA), Fribourg, Switzerland, August 23–24, 2012, Proceedings.
books@ocg.at 290, Österreichische Computer Gesellschaft, Austria, 2012.

  RONNY HARBICH, BIANCA TRUTHE:
A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems – Part I.
International Journal of Foundations in Computer Science 23 (2012) 1, 99–114.

  RONNY HARBICH, BIANCA TRUTHE:
A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems – Part II.
Journal of Automata, Languages and Combinatorics 17 (2012) 1, 17–56.

  FLORIN MANEA, BIANCA TRUTHE:
On Internal Contextual Grammars with Subregular Selection Languages.
In: 14th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2012, Braga, Portugal, July 23–25, 2012, Proceedings. LNCS 7386, Springer, 2012, 222–235.

  FLORIN MANEA, BIANCA TRUTHE:
On Internal Contextual Grammars with Subregular Selection Languages.
In: FRANTIŠEK MRÁZ (ed.), 22nd Theorietag `Automata and Formal Languages', Prague, Czech Republic, October 3–5, 2012. Proceedings. Charles University in Prague, Fakulty of Mathematics and Physics, 2012, 103–108.

  RALF STIEBE:
On Grammars Controlled by Parikh Vectors.
In: HENNING BORDIHN, MARTIN KUTRIB, BIANCA TRUTHE (eds.), Languages Alive – Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. LNCS 7300, Springer, 2012, 246–264.

  SHERZOD TURAEV, JÜRGEN DASSOW, FLORIN MANEA, MOHD HASAN SELAMAT:
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity.
Theoretical Computer Science 449 (2012) 1, 134–144.

2011  

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
Generating Networks of Splicing Processors.
In: RUDOLF FREUND, MARKUS HOLZER, CARLO MEREGHETTI, FRIEDRICH OTTO, BEATRICE PALANO (eds.), 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:
Networks of Evolutionary Processors with Subregular Filters.
Technical Report AFL-2011-01, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2011.

  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: MARKUS HOLZER, MARTIN KUTRIB, GIOVANNI PIGHIZZINI (eds.), 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.

  JÜRGEN DASSOW, VICTOR MITRANA, BIANCA TRUTHE:
The Role of Evolutionary Operations in Accepting Hybrid Networks of Evolutionary Processors.
Information and Computation 209 (2011) 3, 368–382.

  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.

  JÜRGEN DASSOW, BIANCA TRUTHE:
On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata.
Fundamenta Informaticae 112 (2011) 2–3, 157–170.

  JÜRGEN DASSOW, SHERZOD TURAEV:
P/T Petri Net Controlled Grammars.
In: GEMMA BEL-ENGUIX, MDOLORES JIMÉNEZ-LÓPEZ (eds.), Bio-Inspired Models for Natural and Formal Languages. Cambridge Scholars Publishing, 2011, 223–238.

  JÜRGEN DASSOW, GYÖRGY VASZIL:
On the Number of Active Symbols in Lindenmayer Systems.
International Journal of Foundations in Computer Science 22 (2011) 1, 223–235.

  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.

  FLORIN MANEA, BIANCA TRUTHE:
Accepting Networks of Evolutionary Processors with Subregular Filters.
Technical Report AFL-2011-04, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2011.

  CARLOS MARTIN-VIDE, BIANCA TRUTHE (eds.):
Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009).
Information and Computation 209, 2011.

  SHERZOD TURAEV, JÜRGEN DASSOW, MOHD HASAN SELAMAT:
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity.
In: MARKUS HOLZER, MARTIN KUTRIB, GIOVANNI PIGHIZZINI (eds.), 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.

  SHERZOD TURAEV, JÜRGEN DASSOW, MOHD HASAN SELAMAT:
Nonterminal complexity of tree controlled grammars.
Theoretical Computer Science 412 (2011) 41, 5789–5795.

2010  

  HENNING BORDIHN, JÜRGEN DASSOW, MARKUS HOLZER:
Extending regular expressions with homomorphic replacement.
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 44 (2010) 2, 229–255.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, GYÖRGY VASZIL:
Variants of competence-based derivations in CD grammar systems.
International Journal of Foundations in Computer Science 21 (2010) 4, 549–569.

  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, FLORIN MANEA, BIANCA TRUTHE:
A Normal Form for Networks of Evolutionary Processors.
Technical Report AFL-2010-02, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2010.

  JÜRGEN DASSOW, FLORIN MANEA, BIANCA TRUTHE:
Networks of Evolutionary Processors with Subregular Filters.
Technical Report AFL-2010-01, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2010.

  JÜRGEN DASSOW, TOMÁŠ 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, RALF STIEBE, BIANCA TRUTHE:
Generative Capacity of Subregularly Tree Controlled Grammars.
International Journal of Foundations in Computer Science 21 (2010) 5, 723–740.

  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.

  JÜRGEN DASSOW, BIANCA TRUTHE:
On Networks of Evolutionary Processors with State Limited Filters.
Technical Report AFL-2010-03, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2010.

  JÜRGEN DASSOW, SHERZOD TURAEV:
Petri Net Controlled Grammars with a Bounded Number of Additional Places.
Acta Cybernetica 19 (2010) 3, 609–634.

  JÜRGEN DASSOW, GIOVANNI PIGHIZZINI, BIANCA TRUTHE (eds.):
Special Issue: Selected Papers of the 11th Workshop on Descriptional Complexity of Formal Systems (Magdeburg, Germany, July 6–9, 2009).
Journal of Automata, Languages and Combinatorics 15, 2010.

  GEMA M. MARTÍN, FRANCISCO J. VICO, JÜRGEN DASSOW, BIANCA TRUTHE:
Low Disruption Transformations on Cyclic Automata.
Fundamenta Informaticae 104 (2010) 1–2, 93–110.

  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.

  BIANCA TRUTHE:
Target Based Accepting Networks of Evolutionary Processors.
Fundamenta Informaticae 104 (2010) 1–2, 161–183.

2009  

  ARTIOM ALHAZOV, JÜRGEN DASSOW, CARLOS MARTÍN-VIDE, YURII ROGOZHIN, BIANCA TRUTHE:
On Networks of Evolutionary Processors with Nodes of Two Types.
Fundamenta Informaticae 91 (2009) 1, 1–15.

  JÜRGEN DASSOW:
Grammars with Commutative, Circular, and Locally Testable Conditions.
In: ZOLTÁN ESIK, ZOLTÁN FÜLÖP (eds.), Automata, Formal Languages, and Related Topics – Dedicated to Ferenc Gécseg on the occassion of his 70th birthday. Institue of Informatics, University of Szeged, Hungary, 2009, 27–37.

  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, GEMA M. MARTÍN, FRANCISCO J. VICO:
A Similarity Measure for Cyclic Unary Regular Languages.
Fundamenta Informaticae 96 (2009) 1–2, 71–88.

  JÜRGEN DASSOW, GEMA M. MARTÍN, FRANCISCO J. VICO:
Some Operations Preserving Primitivity of Words.
Theoretical Computer Science 410 (2009) 30–32, 2910–2919.

  JÜRGEN DASSOW, VICTOR MITRANA:
Accepting Networks of Non-Inserting Evolutionary Processors.
In: CORRADO PRIAMI ET AL. (ed.), Transactions on Computational Systems Biology XI. LNBI 5750, Springer, 2009, 187–199.

  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.

  JÜRGEN DASSOW, GIOVANNI PIGHIZZINI, BIANCA TRUTHE (eds.):
Eleventh International Workshop on Descriptional Complexity of Formal Systems. Magdeburg, Germany, July 6–9, 2009. Proceedings.
EPTCS 3, 2009.

  JÜRGEN DASSOW, RALF STIEBE, BIANCA TRUTHE:
Two Collapsing Hierarchies of Subregularly Tree Controlled Languages.
Theoretical Computer Science 410 (2009) 35, 3261–3271.

  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.

  JÜRGEN DASSOW, SHERZOD TURAEV:
Petri Net Controlled Grammars: the Case of Special Petri Nets.
Journal of Universal Computer Science 15 (2009) 14, 2808–2835.

  JÜRGEN DASSOW, SHERZOD TURAEV:
Petri Net Controlled Grammars: the Power of Labeling and Final Markings.
Romanian Journal of Information Science and Technology 12 (2009) 2, 191–207.

  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, HENNING FERNAU:
Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach.
Information and Computation 206 (2008) 9/10, 1095–1103.

  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, RALF STIEBE:
Nonterminal Complexity of Some Operations on Context-Free Languages.
Fundamenta Informaticae 83 (2008) 1–2, 35–49.

  JÜRGEN DASSOW, BIANCA TRUTHE (eds.):
Colloquium on the Occasion of the 50th Birthday of Victor Mitrana. Proceedings. Magdeburg, Germany, June 27, 2008.
Technical Report 11/2008, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2008.

  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ÎRNĂUCĂ (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:
Blind Counter Automata on ω-Words.
Fundamenta Informaticae 83 (2008) 1–2, 51–64.

  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.

  RALF STIEBE:
Slender Siromoney matrix languages.
Information and Computation 206 (2008) 9/10, 1248–1258.

  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:
Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements.
International Journal of Foundations in Computer Science 19 (2008) 4, 873–886.

  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  

  HENNING BORDIHN, BERND REICHEL, RALF STIEBE, BIANCA TRUTHE (eds.):
Aspects of Language and Automata Theory – Special Issue Dedicated to Jürgen Dassow.
International Journal of Foundations in Computer Science 18 (6), 2007.

  JÜRGEN DASSOW:
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions.
Fundamenta Informaticae 76 (2007) 3, 293–304.

  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 Košice, Slovakia, 2007, 162–169.

  JÜRGEN DASSOW, RALF STIEBE:
Nonterminal Complexity of Some Operations on Context-Free Languages.
Technical Report 3/2007, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2007.

  JÜRGEN DASSOW, BIANCA TRUTHE:
On the Number of Components for Some Parallel Communicating Grammar Systems.
Theoretical Computer Science 387 (2007) 2, 136–146.

  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:
On the Power of Networks of Evolutionary Processors.
Technical Report 4/2007, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2007.

  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 Košice, 2007, 141–152.

2006  

  MADALINA BARBAIANI, CRISTINA BIBIRE, JÜRGEN DASSOW, AIDAN DELANEY, SZILÁRD FAZEKAS, MIHAI IONESCU, GUANGWU LIU, ATIF LODHI, BENEDEK NAGY:
The power of programmed grammars with graphs from various classes.
Journal of Applied Mathematics & Computing 22 (2006) 1–2, 21–38.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, MARKUS HOLZER:
CD grammar systems with competence based entry conditions in their cooperation protocols.
International Journal of Computer Mathematics 83 (2006) 2, 159–169.

  JÜRGEN DASSOW, ERZSÉBET CSUHAJ-VARJÚ:
On the syntactic complexity of Darwinian membrane systems.
In: CARMEN GRACIANI DÍAZ, GHEORGHE PĂUN, 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, CARLOS MARTÍN-VIDE, VICTOR MITRANA:
Some remarks on homogeneous generating networks of free evolutionary processors.
In: KG. SUBRAMANIAN, KRANGARAJAN, MADHAVAN MUKUND (eds.), Formal models, languages and applications. World Scientific, 2006, 65–78.

  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 PĂUN, 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.

  BIANCA TRUTHE:
The finiteness of synchronous, tabled picture languages is decidable.
Theoretical Computer Science 366 (2006) 3, 297–315.

2005  

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
A remark on evolutionary systems.
Discrete Applied Mathematics 146 (2005) 1, 111–115.

  JÜRGEN DASSOW:
Completeness of automaton mappings with respect to equivalence relations.
In: VALERY B. KUDRYAVTSEV, IVO G. ROSENBERG (eds.), Structural Theory of Automata, Semigroups, and Universal Algebra. Springer, 2005, 77–108.

  JÜRGEN DASSOW:
Contextual grammars with subregular choice.
Fundamenta Informaticae 64 (2005) 1–4, 109–118.

  JÜRGEN DASSOW:
Logik für Informatiker.
B. G. Teubner, 2005.

  JÜRGEN DASSOW, MARKUS HOLZER:
Language families defined by a ciliate bio-operation: hierarchies and decision problems.
International Journal of Foundations in Computer Science 16 (2005) 4, 645–662.

  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.

  BIANCA TRUTHE:
Endlichkeit von Bildsprachen synchroner, kontextfreier Ketten-Code-Bild-Systeme.
Dissertation, Otto-von-Guericke-Universität Magdeburg, 2005. Shaker-Verlag Aachen, ISBN: 978-3-8322-4223-7.

  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:
On the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems.
Acta Cybernetica 17 (2005), 53–73.

2004  

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems.
In: JUHANI KARHUMÄKI, HERRMANN A. MAURER, GHEORGHE PĂUN, GRZEGORZ ROZENBERG (eds.), Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday. LNCS 3113, Springer, 2004, 49–59.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, MARKUS HOLZER:
CD Grammar Systems with Competence Based Entry Conditions in Their Cooperation Protocols.
Technical Report 2004/4, MTA SZTAKI Budapest, 2004.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, MARKUS HOLZER:
On A Competence-based Cooperation Strategy in CD Grammar Systems.
Technical Report 2004/3, MTA SZTAKI Budapest, 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:
Grammars with regulated rewriting.
In: CARLOS MARTÍN-VIDE, VICTOR MITRANA, GHEORGHE PĂUN (eds.), Formal Languages and Applications. Studies in Fuzziness and Softcomputing 148, Springer, 2004, 249–273.

  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.
International Journal of Foundations in Computer Science 15 (2004) 4, 663–672.

  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.

  JÜRGEN DASSOW, HELMUT JÜRGENSEN, DETLEF WOTSCHKE (eds.):
Selected Papers of the `Fourth International Workshop on Descriptional Complexity of Formal Systems, DCFS '02 (London, Canada, August 21–24, 2002).
Journal of Automata, Languages and Combinatorics 9/2–3, 2004.

  JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PĂUN, RALF STIEBE:
On differentiation functions, structure functions, and related languages of context-free grammars.
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 38 (2004) 3, 257–267.

  JÜRGEN DASSOW, GYÖRGY VASZIL:
Multiset splicing systems.
Biosystems 74 (2004), 1–7.

  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 synchroner, tabellierter Ketten-Code-Bild-Systeme.
Technical Report 8/2004, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2004.

  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:
Bemerkungen zur Entwicklung der Technischen Universität `Otto von Guericke' im Zeitraum 1990–1993.
In: KLAUS ERICH POLLMANN (ed.), Die Otto-von-Guericke-Universität Magdeburg: Festschrift. Mitteldeutscher Verlag, Halle/Saale, 2003, 49–57.

  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:
A Remark on Extended Simple Eco-Grammar Systems.
Romanian Journal of Information Science and Technology (Bucuresti) 6 (2003) 1/2, 135–139.

  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.

  CARLOS MARTÍN-VIDE, VICTOR MITRANA, RALF STIEBE:
Weighted grammars and automata with threshold interpretation.
Journal of Automata, Languages and Combinatorics 8 (2003) 2, 303–318.

  RALF STIEBE:
Positive valence grammars.
In: ERZSÉBET CSUHAJ-VARJÚ, CHANDRA MR. KINTALA, DETLEF WOTSCHKE, GYÖRGY VASZIL (eds.), Descriptional Complexity of Formal Systems. MTA SZTAKI, Budapest, 2003, 186–197.

  BIANCA TRUTHE:
On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems.
Fundamenta Informaticae 56 (2003) 4, 389–409.

  BIANCA TRUTHE:
Zur Endlichkeit von Bildsprachen synchroner, deterministisch-tabellierter Ketten-Code-Bild-Systeme.
Technical Report 15/2003, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2003.

  BIANCA TRUTHE:
Zur Endlichkeit von Bildsprachen synchroner, einfach-nichtdeterministischer Ketten-Code-Bild-Systeme.
Technical Report 7/2003, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2003.

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 BORDIHN, HENNING FERNAU, MARKUS HOLZER:
Accepting Pure Grammars.
Publicationes Mathematicae 60 (2002), 483–510.

  HENNING BORDIHN, BERND REICHEL:
On Descriptions of Context-Free Languages by CD Grammar Systems.
Journal of Automata, Languages and Combinatorics 7 (2002) 4, 447–454.

  JÜRGEN DASSOW, VICTOR MITRANA, ARTO SALOMAA:
Operations and language generating devices suggested by the genome evolution.
Theoretical Computer Science 270 (2002), 701–738.

  JÜRGEN DASSOW, DETLEF WOTSCHKE, BERND REICHEL (eds.):
Selected papers of the `Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures' (Vienna, Austria, July 20–22, 2001).
Journal of Automata, Languages and Combinatorics 7/4, 2002.

  HENNING FERNAU, RALF STIEBE:
Sequential Grammars and Automata with Valences.
Theoretical Computer Science 276 (2002) 1/2, 377–405.

  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.

  MASAMI ITO, JÜRGEN DASSOW, RALF STIEBE:
Some Remarks on Codes Defined by Petri Nets.
Journal of Universal Computer Science 8 (2002) 2, 260–269.

  BIANCA TRUTHE:
Zur Endlichkeit von Bildsprachen synchroner, deterministischer Ketten-Code-Bild-Systeme.
Technical Report 8/2002, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2002.

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.

  JÜRGEN DASSOW:
Conditional grammars with restrictions by syntactic parameters.
In: MASAMI ITO, GHEORGHE PĂUN, SHENG YU (eds.), Words, Semigroups, Transductions. World Scientific, 2001, 59–68.

  JÜRGEN DASSOW:
Parikh mapping and iteration.
In: CRISTIAN S. CALUDE, GHEORGHE PĂUN, GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Multiset Processing. LNCS 2235, Springer-Verlag, Berlin, 2001, 85–101.

  JÜRGEN DASSOW:
Subregularly controlled derivations: restrictions by syntactic parameters.
In: CARLOS MARTÍN-VIDE, VICTOR MITRANA (eds.), Where Mathematics, Computer Science, Linguistics and Biology Meet. Kluwer Academic Publishers, 2001, 51–61.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
P systems with communication based on concentration.
Acta Cybernetica 15 (2001) 1, 9–23.

  JÜRGEN DASSOW, GHEORGHE PĂUN, GABRIEL THIERRIN, SHENG YU:
Tree systems of morphisms.
Acta Informatica 38 (2001) 2, 131–153.

  JÜRGEN DASSOW, BERND REICHEL (eds.):
Tagungsband des 11. Theorietages der GI-Fachgruppe 0.1.5 `Automaten und Formale Sprachen' mit dem Workshop `Coding Theory and Formal Languages', Wendgräben, 3.–6. Oktober 2001.
Technischer Bericht 18, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2001.

  JÜRGEN DASSOW, DETLEF WOTSCHKE (eds.):
Tagungsband des Workshops on Descriptional Complexity of Automata, Grammars and Related Structures, DCAGRS 2001, Wien, Österreich, 20.–22. Juli 2001.
Technischer Bericht 16, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 2001.

  HENNING FERNAU, RALF STIEBE:
Valence Grammars with Target Sets.
In: MASAMI ITO, GHEORGHE PĂUN, SHENG YU (eds.), Words, Semigroups, and Transductions. World Scientific, 2001, 129–140.

  HENNING FERNAU, RALF STIEBE:
Valences in Lindenmayer Systems.
Fundamenta Informaticae 45 (2001) 4, 329–358.

  VICTOR MITRANA, RALF STIEBE:
Extended Finite Automata over Groups.
Discrete Applied Mathematics 108 (2001), 287–300.

  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, JÜRGEN DASSOW, GYÖRGY VASZIL:
Parallel Communicating Grammar Systems As Language Analyzers.
Grammars 3 (2000), 1–20.

  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:
Grammar systems with negated conditions in their cooperation protocols.
Journal of Universal Computer Science 6 (2000) 12, 1165–1184.

  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.

  JÜRGEN DASSOW:
Evolution and grammars. IX Tarragona Seminar on Formal Syntax and Semantics.
Technical Report 12/00, Universitat Roviri i Virgili Tarragona, Research Group on Mathematical Linguistics, 2000.

  JÜRGEN DASSOW, CARLOS MARTÍN-VIDE, GHEORGHE PĂUN, ALFONSO RODRÍGUEZ-PATON:
Conditional Concatenation.
Fundamenta Informaticae 44 (2000) 4, 353–372.

  JÜRGEN DASSOW, VICTOR MITRANA:
Finite Automata over Free Groups.
International Journal of Algebra and Computation 10 (2000) 6, 725–737.

  JÜRGEN DASSOW, DETLEF WOTSCHKE (eds.):
Selected Papers of the First International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, DCAGRS '99 (Magdeburg, Germany, July 20–23, 1999).
Journal of Automata, Languages and Combinatorics 5/3, 2000.

  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.

  RALF STIEBE:
Untersuchungen zu Kantengrammatiken und Valenzgrammatiken.
Dissertation, Martin-Luther-Universität Halle-Wittenberg, 2000.

1999  

  HENNING BORDIHN:
On a Grammatical Approach to the LBA Problem.
Technical Report 5/1999, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 1999.

  HENNING BORDIHN, ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
CD grammar systems versus L systems.
In: GHEORGHE PĂUN, ARTO SALOMAA (eds.), Grammatical Models for Multi Agent Systems. Gordon and Breach Science Publishers, 1999, 18–32.

  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 PĂUN (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.

  HENNING BORDIHN, HENNING FERNAU, MARKUS HOLZER:
On accepting pure Lindenmayer systems.
Fundamenta Informaticae 38 (1999) 4, 365–375.

  HENNING BORDIHN, MARKUS HOLZER:
On a hierarchy of languages generated by cooperating distributed grammar systems.
Information Processing Letters 69 (1999) 2, 59–62.

  JÜRGEN DASSOW:
Context-sensitive languages.
In: JOHN G. WEBSTER (ed.), Wiley Encyclopedia of Electrical and Electronics Engineering. John Wiley & Sons, Chicester, 1999, 239–247.

  JÜRGEN DASSOW:
Numerical parameters of evolutionary grammars.
In: JUHANI KARHUMÄKI, HERRMANN A. MAURER, GHEORGHE PĂUN, GRZEGORZ ROZENBERG (eds.), Jewels are Forever. Springer, 1999, 171–181.

  JÜRGEN DASSOW, HENNING FERNAU, GHEORGHE PĂUN:
On the leftmost derivation in matrix grammars.
International Journal of Foundations in Computer Science 10 (1999) 1, 61–79.

  JÜRGEN DASSOW, VICTOR MITRANA:
DOL pattern languages.
Publicationes Mathematicae 54 (1999), 653–665.

  JÜRGEN DASSOW, VICTOR MITRANA:
Stack Cooperation in Multistack Pushdown Automata.
Journal of Computer and System Sciences 58 (1999) 3, 611–621.

  JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PĂUN:
On the regularity of duplication closure.
Bulletin of the EATCS 69 (1999), 133–136.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Min of Mat is not necessarily Mat.
Information Processing Letters 71 (1999) 5/6, 175–177.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On the power of membrane computing.
Journal of Universal Computer Science 5 (1999) 2, 33–49.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On the regularity of languages generated by context-free evolutionary grammars.
Discrete Applied Mathematics 92 (1999) 2/3, 205–209.

  JÜRGEN DASSOW, DETLEF WOTSCHKE (eds.):
Tagungsband des Workshops on Descriptional Complexity of Automata, Grammars and Related Structures, DCAGRS 1999, Magdeburg, Germany, July 20–23, 1999.
Technischer Bericht 17, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, 1999.

  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.

  BIANCA TRUTHE:
Zur Endlichkeit von Bildsprachen synchroner, deterministischer Ketten-Code-Bild-Systeme.
Diplomarbeit, Otto-von-Guericke-Universität Magdeburg, 1999.

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:
Biologische Impulse für formale Sprachen. Antrittsvorlesung 1996.
In: Universitätsschriften. Antrittsvorlesungen der Fakultät für Informatik. Otto-von-Guericke Universität Magdeburg, 1998, 53–73.

  JÜRGEN DASSOW:
On special networks of parallel language processors.
Romanian Journal of Information Sciences and Technologies 1 (1998), 331–341.

  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, RUDOLF KRUSE (eds.):
Informatik '98 – Informatik zwischen Bild und Sprache, 28. Jahrestagung der Gesellschaft für Informatik, Magdeburg, 21.–25. September 1998.
Springer, 1998.

  JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PĂUN:
Convex and anti-convex languages.
International Journal of Computer Mathematics 69 (1998), 1–16.

  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:
On the leftmost derivation in cooperating grammar systems.
Revue Roumaine Math. Pures Appl. 43 (1998), 361–374.

  JÜRGEN DASSOW, VICTOR MITRANA:
Self cross-over systems.
In: GHEORGHE PĂUN (ed.), Computing with Bio-Molecules. Theory and Experiments. Springer-Verlag, Singapore, 1998, 283–294.

  JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PĂUN:
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.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Remarks on operations suggested by mutations in genomes.
Fundamenta Informaticae 36 (1998), 183–200.

1997  

  HENNING BORDIHN:
A grammatical approach to the LBA problem.
In: GHEORGHE PĂUN, ARTO SALOMAA (eds.), New Trends in Formal Languages. LNCS 1218, Springer, 1997, 1–9.

  JÜRGEN DASSOW, VICTOR MITRANA:
Cooperation in context-free grammars.
Theoretical Computer Science 180 (1997), 353–361.

  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, AKEITH DUNKER, LAWRENCE HUNTER, TERI K. KLEIN (eds.), Pacific Symposium on Biocomputing'97. World Scientific, 1997, 97–108.

  JÜRGEN DASSOW, VICTOR MITRANA, ARTO SALOMAA:
Context-free evolutionary grammars and the structural language of nucleic acids.
BioSystems 43 (1997) 3, 169–177.

  JÜRGEN DASSOW, GHEORGHE PĂUN, GRZEGORZ ROZENBERG:
Grammar systems.
In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Handbook of Formal Languages. Springer, 1997, 155–213.

  JÜRGEN DASSOW, GHEORGHE PĂUN, ARTO SALOMAA:
Grammars with controlled derivations.
In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Handbook of Formal Languages. Springer, 1997, 101–154.

  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.

  VICTOR MITRANA, RALF STIEBE:
The Accepting Power of Finite Automata over Groups.
In: New Trends in Formal Languages – Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday). LNCS 1218, Springer, 1997, 39–48.

1996  

  HENNING BORDIHN, ERZSÉBET CSUHAJ-VARJÚ:
On competence and completeness in CD grammar systems.
Acta Cybernetica 12 (1996) 4, 347–360.

  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.

  HENNING BORDIHN, HENNING FERNAU:
Accepting grammars and systems via context condition grammars.
Journal of Automata, Languages and Combinatorics 1 (1996) 2, 97–112.

  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.

  JÜRGEN DASSOW, VICTOR MITRANA:
Call-by-name and call-by-value strategies in grammar systems.
Annales Univ. Bucuresti Mat. Inform. 45 (1996), 29–40.

  JÜRGEN DASSOW, VICTOR MITRANA:
Fairness in grammar systems.
Acta Cybernetica 12 (1996) 4, 331–345.

  JÜRGEN DASSOW, VICTOR MITRANA:
Splicing grammar systems.
Computers and Artificial Intelligence 15 (1996), 109–122.

  JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PĂUN, SORINA VICOLOV:
On determinism in cooperating distributed grammar systems.
Publicationes Mathematicae 48 (1996), 217–321.

  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.

  HENNING FERNAU, MARKUS HOLZER, HENNING BORDIHN:
Accepting multi-agent systems: The case of cooperating distributed grammar systems.
Computers and Artificial Intelligence 15 (1996) 2–3, 123–139.

  STEFAN SKALLA:
Über syntaktische Parameter kooperierender Grammatiksysteme.
Dissertation, Otto-von-Guericke-Universität Magdeburg, 1996.

  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.

  JÜRGEN DASSOW:
An example of an eco-grammar system: a can collecting robot.
In: GHEORGHE PĂUN (ed.), Artificial Life: Grammatical Models. Black Sea University Press, 1995, 240–244.

  JÜRGEN DASSOW:
Cooperating grammar systems (Definitions, basic results, open problems).
In: GHEORGHE PĂUN (ed.), Artificial Life: Grammatical Models. Black Sea University Press, 1995, 40–52.

  JÜRGEN DASSOW, RUDOLF FREUND, GHEORGHE PĂUN:
Cooperating array grammar systems.
Intern. J. Pattern Recognition and Artificial Intelligence 9 (1995), 1029–1053.

  JÜRGEN DASSOW, HELMUT JÜRGENSEN:
The transition monoids of soliton trees.
In: GHEORGHE PĂUN (ed.), Mathematical Lingiustics and Related Topics. Editura Academiei Romane, Bucuresti, 1995, 76–86.

  JÜRGEN DASSOW, VALERIA MIHALACHE:
Eco-grammar systems, matrix grammars and EOL systems.
In: GHEORGHE PĂUN (ed.), Artificial Life: Grammatical Models. Black Sea University Press, 1995, 210–226.

  JÜRGEN DASSOW, GHEORGHE PĂUN, SORINA VICOLOV:
On the generative capacity of certain classes of cooperating grammar systems.
Fundamenta Informaticae 22 (1995), 217–226.

  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.

  HENNING FERNAU, HENNING BORDIHN:
Remarks on accepting parallel systems.
International Journal of Computer Mathematics 56 (1995), 51–67.

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.

  HENNING BORDIHN, HENNING FERNAU:
Accepting grammars and systems.
Technical Report 9/94, Universität Karlsruhe, Fakultät für Informatik, 1994.

  HENNING BORDIHN, HENNING FERNAU:
Accepting grammars with regulation.
International Journal of Computer Mathematics 53 (1994), 1–18.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, JOZEF KELEMEN, GHEORGHE PĂUN:
Grammar Systems: A Grammatical Approach to Distribution and Cooperation.
Topics in Computer Science 5, Gordon and Breach Science Publishers, 1994.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, JOZEF KELEMEN, GHEORGHE PĂUN:
Stratified grammar systems.
Computers and Artificial Intelligence 13 (1994), 409–422.

  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, MASAMI ITO, GHEORGHE PĂUN:
On the subword density of languages.
Southeast Asian Bulletin of Mathematics 18 (1994), 49–61.

  JÜRGEN DASSOW, ALICA KELEMENOVA (eds.):
Developments in Theoretical Computer Science. Proceedings of the `International Meeting of Young Computer Scientists', Smolenice, 1992.
Gordon and Breach Science Publishers, 1994.

  JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PĂUN:
Iterative reading of numbers: The ordered case.
In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Developments in Language Theory. World Scientific, 1994, 157–168.

  GHEORGHE PĂUN, 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  

  MICEA ANDRASIU, JÜRGEN DASSOW, GHEORGHE PĂUN, ARTO SALOMAA:
Language-theoretic problems arising from Richelieu cryptosystems.
Theoretical Computer Science 116 (1993) 2, 339–357.

  FRANZ-JOSEF BRANDENBURG, JÜRGEN DASSOW:
On efficient reductions of picture words.
RAIRO Informatique théorique 27 (1993), 49–56.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
A note on cooperating grammars: terminal productions suffice.
Computers and Artificial Intelligence 12 (1993), 99–104.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PĂUN:
Cooperation in grammar systems: universality, similarity, timing.
Kybernetika 36 (1993), 271–286.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, GHEORGHE PĂUN:
Dynamically controlled cooperating/distributed grammar systems.
Information Sciences 69 (1993), 1–25.

  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.

  JÜRGEN DASSOW, FRIEDHELM HINZ:
Decision problems and regular chain code picture languages.
Discrete Applied Mathematics 45 (1993) 1, 29–49.

  JÜRGEN DASSOW, HELMUT JÜRGENSEN:
Deterministic soliton automata with at most one cycle.
Journal of Computer and System Sciences 46 (1993), 155–197.

  JÜRGEN DASSOW, JOZEF KELEMEN, GHEORGHE PĂUN:
On parallelism in colonies.
Cybernetics and Systems 24 (1993), 37–49.

  JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PĂUN:
Iterated reading of numbers and `black-holes'.
Periodica Math. Hungarica 27 (1993), 137–152.

  JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PĂUN:
Iterative reading of numbers: Parikh mappings, parallel rewriting, infinite sequences.
Technical Report FIN-IRB-6/93, Technische Universität `Otto von Guericke' Magdeburg, Fakultät für Informatik, 1993.

  JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PĂUN:
Szilard languages associated to cooperating distributed grammar systems.
Stud. Cerc. Mat. 45 (1993), 403–413.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Cooperating/distributed grammar systems with regular components.
Computers and Artificial Intelligence 12 (1993), 71–93.

  JÜRGEN DASSOW, GHEORGHE PĂUN, ARTO SALOMAA:
Grammars based on patterns.
International Journal of Foundations in Computer Science 4 (1993) 1, 1–14.

  JÜRGEN DASSOW, GHEORGHE PĂUN, ARTO SALOMAA:
On the union of OL languages.
Inform. Process. Letters 47 (1993), 59–63.

  JÜRGEN DASSOW, GHEORGHE PĂUN, ARTO SALOMAA:
On thinness and slenderness of L languages.
Bulletin of the EATCS 49 (1993), 152–158.

  JÜRGEN DASSOW, GHEORGHE PĂUN, SORINA VICOLOV:
On the power of cooperating/distributed grammar systems with regular components.
Foundations of Computing and Decision Sciences 18 (1993), 83–108.

  BIANCA TRUTHE:
Linear Programming and Economic Analysis.
In: Scientific Works submitted by the Participants of the Dr. Bessie F. Lawrence 25th International Summer Science Institute, 1993. Weizmann Institute of Science, Rehovot, Israel, 1993, 172–177.

1992  

  HENNING BORDIHN:
Pure languages and the degree of nondeterminism.
J. Inf. Process. Cybern. 28 (1992) 5, 231–240.

  HENNING BORDIHN:
Über den Determiniertheitsgrad reiner Versionen formaler Sprachen.
Dissertation, Techn. Universität `Otto-von-Guericke' Magdeburg, 1992.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, JOZEF KELEMEN:
Cooperating/distributed grammar systems with different styles of acceptance.
International Journal of Computer Mathematics 42 (1992) 2, 173–183.

  JÜRGEN DASSOW (ed.):
Tagungsbericht `Mathematische Aspekte der Informatik', Magdeburg, 1990.
J. Inf. Process. Cybern. 28/5, 1992.

  JÜRGEN DASSOW, JURAJ HROMKOVIC:
On synchronized Lindenmayer picture languages.
In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), Lindenmayer Systems. Springer, 1992, 253–261.

  JÜRGEN DASSOW, ALEXANDRU MATEESCU, GHEORGHE PĂUN, ARTO SALOMAA:
Regularizing context-free languages by AFL operations: concatenation and Kleene closure.
Acta Cybernetica 10 (1992) 4, 243–253.

  RALF STIEBE:
Picture Generation Using Matrix Systems.
Elektronische Informationsverarbeitung und Kybernetik 28 (1992) 5, 311–327.

1991  

  HENNING BORDIHN:
On some deterministic grammars with regulated rewriting.
Analele Universitatii Bucaresti XXXIX-XL (1991) 3, 35–48.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
On bounded interpretations of grammar forms.
Theoretical Computer Science 87 (1991) 2, 287–313.

  JÜRGEN DASSOW:
Cooperating/distributed grammar systems with hypothesis languages.
Journal of Experimental and Theoretical Artificial Intelligence 3 (1991), 11–16.

  JÜRGEN DASSOW:
On the connectedness of chain code picture languages.
Theoretical Computer Science 81 (1991) 2, 289–294.

  JÜRGEN DASSOW:
A remark on cooperating/distributive grammar systems controlled by a graph.
Wissenschaftliche Zeitschrift der Technischen Universität Magdeburg 35 (1991), 4–6.

  JÜRGEN DASSOW, HELMUT JÜRGENSEN:
Deterministic soliton automata with a single exterior node.
Theoretical Computer Science 84 (1991) 2, 281–292.

  JÜRGEN DASSOW, JOZEF KELEMEN:
Cooperating/distributive grammar systems: a link between formal languages and artificial intelligence.
Bulletin of the EATCS 45 (1991), 131–145.

  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.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On the succinctness of descriptions of context-free languages by cooperating/distributed grammar systems.
Computers and Artificial Intelligence 10 (1991), 513–527.

1990  

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
On cooperating/distributed grammar systems.
J. Inf. Process. Cybern. 26 (1990), 49–63.

  JÜRGEN DASSOW (ed.):
Tagungsbericht `Mathematische Aspekte der Informatik', Magdeburg, 1988.
J. Inf. Process. Cybern. 26/1–2, 1990.

  JÜRGEN DASSOW, HELMUT JÜRGENSEN:
Soliton automata.
Journal of Computer and System Sciences 40 (1990), 158–181.

  JÜRGEN DASSOW, HELMUT JÜRGENSEN, WOLFGANG RÜLLING:
Information transmission in IL systems.
International Journal of Computer Mathematics 37 (1990) 1, 1–19.

  JÜRGEN DASSOW, JOZEF KELEMEN (eds.):
Aspects and Prospects of Theoretical Computer Science. Proceedings of the `International Meeting of Young Computer Scientists', Smolenice, 1990.
LNCS 464, Springer-Verlag, 1990.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Cooperating/distributed grammar systems with registers.
Foundations of Control Engineering 15 (1990), 19–38.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On some variants of cooperating/distributed grammar systems.
Stud. Cerc. Math. 42 (1990), 153–165.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On the degree of non-regularity of context-free languages.
International Journal of Computer Mathematics 36 (1990), 13–29.

  JÜRGEN DASSOW, RALF STIEBE:
On graph-theoretical closure properties of chain code picture languages.
Technical Report 2/90, Technische Universität `Otto von Guericke' Magdeburg, Sektion Mathematik, 1990.

  JÜRGEN DASSOW, DIETMAR WÄTJEN:
On the relations between the degree of synchronization and the degree of nondeterminism in k-limited and uniformly k-limited TOL systems.
International Journal of Computer Mathematics 35 (1990), 69–82.

  BERND REICHEL:
Über Normalformen und Kompliziertheit indisch-paralleler Grammatiken und Sprachen.
Dissertation, Technische Universität `Otto von Guericke' Magdeburg, 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:
Graph-theoretical properties and chain code picture languages.
J. Inf. Process. Cybern. 25 (1989), 423–433.

  JÜRGEN DASSOW, FRIEDHELM HINZ:
Kettenkode-Bildsprachen: Theorie und Anwendungen.
Wissenschaftliche Zeitschrift der Technischen Universität Magdeburg 33 (1989), 1–12.

  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.

  JÜRGEN DASSOW, JOZEF KELEMEN (eds.):
Machines, Languages, and Complexity. Proceedings of the `International Meeting of Young Computer Scientists', Smolenice, 1988.
LNCS 381, Springer-Verlag, 1989.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Regulated Rewriting in Formal Language Theory.
EATCS Monographs in Theoretical Computer Science 18, Springer, 1989.

  FRIEDHELM HINZ, JÜRGEN DASSOW:
An undecidability result for regular languages and its application to regulated rewriting.
Bulletin of the EATCS 38 (1989), 168–174.

  WERNER LOCH:
Zum Äquivalenzproblem für deterministische T0L-Systeme.
Dissertation, Technische Universität `Otto von Guericke' Magdeburg, 1989.

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.

  ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW:
Message handling grammar systems.
Papers on Automata and Formal Languages X (1988), 71–82.

  JÜRGEN DASSOW:
Convexity and simplicity of chain code picture languages.
Rostock. Math. Kolloq. 34 (1988), 53–60.

  JÜRGEN DASSOW:
On fully initial context-free languages.
Papers on Automata and Formal Languages X (1988), 3–6.

  JÜRGEN DASSOW:
On the sequence equivalence problem for OL systems with controlled derivations.
Computers and Artificial Intelligence 7 (1988), 97–105.

  JÜRGEN DASSOW:
Pure languages of regulated rewriting and their codings.
Acta Cybernetica 8 (1988) 3, 227–235.

  JÜRGEN DASSOW:
A remark on limited OL systems.
J. Inf. Process. Cybern. 24 (1988), 287–291.

  JÜRGEN DASSOW:
Subregularly controlled derivations: the context-free case.
Rostock. Math. Kolloq. 34 (1988), 61–70.

1987  

  HENNING BORDIHN:
On deterministic grammars with valuations.
Wissenschaftliche Zeitschrift der Technischen Universität Magdeburg 31 (1987), 1–3.

  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.

  JÜRGEN DASSOW, LUDWIG STAIGER (eds.):
Tagungsbericht `Mathematische Aspekte der Informatik', Mägdesprung, 1986.
J. Inf. Process. Cybern. 23/8–9, 1987.

1986  

  HENNING BORDIHN:
Über deterministische Grammatiken mit Bewertungen.
Diplomarbeit, Techn. Hochschule `Otto-von-Guericke' Magdeburg, 1986.

  JÜRGEN DASSOW:
On compound Lindenmayer systems.
In: GRZEGORZ ROZENBERG, ARTO SALOMAA (eds.), The Book of L. Springer, 1986, 75–86.

  JÜRGEN DASSOW:
Pure grammars with regulated rewriting.
Revue Roumaine Math. Pures Appl. 31 (1986), 657–666.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Further remarks on pure grammars with regulated rewriting.
Revue Roumaine Math. Pures Appl. 31 (1986), 855–864.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On the complexity of regulated rewriting.
Bull. Math. Soc. Sci. Math. R.S.Roumain 30 (1986), 203–212.

1985  

  GUSTAV BUROSCH, JÜRGEN DASSOW, WALTER HARNAU, DIETLINDE LAU:
On subalgebras of an algebra of predicates.
Elektronische Informationsverarbeitung und Kybernetik 21 (1985), 9–22.

  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.

  JÜRGEN DASSOW:
On contextual grammar forms.
International Journal of Computer Mathematics 17 (1985), 37–52.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Further remarks on the complexity of regulated rewriting.
Kybernetika 21 (1985), 213–227.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
On ordered variants of some regulated grammars.
Elektronische Informationsverarbeitung und Kybernetik 21 (1985), 491–504.

  JÜRGEN DASSOW, UWE WOLTER:
Remarks on equality languages.
Wissenschaftliche Zeitschrift der Technischen Hochschule Magdeburg 29 (1985), 122–126.

1984  

  JÜRGEN DASSOW:
A note on DTOL systems.
Bulletin of the EATCS 22 (1984), 11–14.

  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:
On some extensions of Russian parallel context-free grammars.
Acta Cybernetica 6 (1984) 4, 355–360.

  JÜRGEN DASSOW:
Remarks on the complexity of regulated rewriting.
Fundamenta Informaticae 7 (1984), 83–103.

  JÜRGEN DASSOW, UWE FEST:
On regulated L systems.
Rostock. Math. Kolloq. 25 (1984), 99–118.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
Codings of pure languages obtained by regulated rewriting.
Foundations of Control Engineering 3 (1984), 3–14.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
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.

1983  

  JÜRGEN DASSOW:
A note on programmed OL systems.
Information Sciences 30 (1983), 1–4.

1982  

  JÜRGEN DASSOW:
Grammars with valuations – a discrete model for self-organization of biopolymers.
Discrete Applied Mathematics 4 (1982) 3, 161–174.

  JÜRGEN DASSOW:
A remark on a paper of My and Păun.
Elektronische Informationsverarbeitung und Kybernetik 18 (1982), 67–68.

  JÜRGEN DASSOW:
Weitere Bemerkungen zu einem modifizierten Vollständigkeitsbegriff in einer Algebra von Automatenabbildungen.
Rostock. Math. Kolloq. 21 (1982), 99–110.

  JÜRGEN DASSOW, WALTER JUST:
Tabled time delayed OL systems.
Wissenschaftliche Zeitschrift der Technischen Hochschule Magdeburg 26 (1982), 43–46.

  JÜRGEN DASSOW, GHEORGHE PĂUN:
L(ET0L[5])=L(ET0L).
Elektronische Informationsverarbeitung und Kybernetik 18 (1982), 345–348.

1981  

  JÜRGEN DASSOW:
Completeness Problems in Structural Automata Theory.
Mathematical Research 7, Akademie-Verlag Berlin, 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.

  JÜRGEN DASSOW, RAINER EHRIG:
Algebraic considerations on AFLs.
Bulletin of the EATCS 14 (1981), 30–32.

1980  

  JÜRGEN DASSOW:
On Parikh-languages of L systems without interaction.
Rostock. Math. Kolloq. 15 (1980), 103–110.

  JÜRGEN DASSOW:
On some extensions of Indian parallel context-free grammars.
Acta Cybernetica 4 (1980) 4, 303–310.

1979  

  JÜRGEN DASSOW:
Concentration dependent OL systems.
International Journal of Computer Mathematics 7 (1979) 3, 187–206.

  JÜRGEN DASSOW:
ETOL systems and compound grammars.
Rostock. Math. Kolloq. 11 (1979), 41–46.

  JÜRGEN DASSOW:
On the circular closure of languages.
Elektronische Informationsverarbeitung und Kybernetik 15 (1979), 87–94.

  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:
Ein modifizierter Vollständigkeitsbegriff in einer Algebra von Automatenabbildungen. Dissertation B.
Habilitationsschrift, Universität Rostock, Sektion Mathematik, 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:
Einige Bemerkungen zu einem modifizierten Vollständigkeitsbegriff für Automatenabbildungen.
Rostock. Math. Kolloq. 3 (1977), 69–84.

  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.

  JÜRGEN DASSOW:
Über Abschlußeigenschaften von biologisch-motivierten Sprachen.
Rostock. Math. Kolloq. 4 (1977), 69–84.

1976  

  JÜRGEN DASSOW:
Eine neue Funktion für Lindenmayer-Systeme.
Elektronische Informationsverarbeitung und Kybernetik 12 (1976), 515–521.

  JÜRGEN DASSOW:
Kleene-Mengen und trennende Mengen.
Mathematische Nachrichten 74 (1976), 89–97.

  JÜRGEN DASSOW:
Über quasideterministische Sprachen.
Rostock. Math. Kolloq. 1 (1976), 51–60.

  JÜRGEN DASSOW, WALTER HARNAU:
Spezielle Gleichungen in freien Halbgruppen und eine Anwendung auf Normalformen regulärer Ereignisse.
Beiträge zur Algebra und Geometrie 5 (1976), 33–40.

1975  

  JÜRGEN DASSOW:
Über das Verhalten der Betti-Reihe eines lokalen Ringes bei monoidalen Transformationen.
Beiträge zur Algebra und Geometrie 4 (1975), 57–63.

  JÜRGEN DASSOW:
Über metrische Kleene-Vollständigkeit.
Elektronische Informationsverarbeitung und Kybernetik 11 (1975), 557–560.

  JÜRGEN DASSOW, DIETER NESSELMANN:
Ideallängen und Multiplizitäten.
Mathematische Nachrichten 67 (1975), 247–250.

1974  

  JÜRGEN DASSOW:
Kleene-Mengen und Kleene-Vollständigkeit.
Elektronische Informationsverarbeitung und Kybernetik 10 (1974), 287–295.

  JÜRGEN DASSOW:
Kleene-Vollständigkeit bei stark-definiten Ereignissen.
Elektronische Informationsverarbeitung und Kybernetik 10 (1974), 399–405.

  JÜRGEN DASSOW:
Über das Verhalten der Hilbert-Koeefizienten eines lokalen Ringes bei monoidalen Transformationen.
Wiss. Zeitschrift d. Univ. Rostock, Math.-Nat. Reihe 8 (1974), 606–612.

  JÜRGEN DASSOW:
Über zwei abgeschlossene Mengen von Automatenoperatoren.
Wiss. Zeitschrift d. Univ. Rostock, Math.-Nat. Reihe 9 (1974), 763–767.

1972  

  GUSTAV BUROSCH, JÜRGEN DASSOW:
Zwei Sätze über monoidale Transformationen.
Mathematische Nachrichten 52 (1972), 247–253.

  JÜRGEN DASSOW:
Normalität und Loewy-Invarianten bei monoidalen Transformationen.
Mathematische Nachrichten 53 (1972), 255–262.

  JÜRGEN DASSOW:
Über das Verhalten von lokalen Ringen bei monoidalen Transformationen. Dissertation A.
Dissertation, Universität Rostock, Sektion Mathematik, 1972.