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

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

2012 JÜRGEN DASSOW, TOMÁS MASOPUST, On restricted context-free grammars. Journal of Computer and System Sciences 78 (2012) 1, 293–304. 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. 2011 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, On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata. Fundamenta Informaticae 112 (2011) 2–3, 157–170. 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. 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, 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, 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, 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, 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, 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, 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. 2008 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, RALF STIEBE, Nonterminal Complexity of Some Operations on Context-Free Languages. Fundamenta Informaticae 83 (2008) 1–2, 35–49. HENNING FERNAU, RALF STIEBE, Blind Counter Automata on ω-Words. Fundamenta Informaticae 83 (2008) 1–2, 51–64. RALF STIEBE, Slender Siromoney matrix languages. Information and Computation 206 (2008) 9/10, 1248–1258. 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. 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, 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, BIANCA TRUTHE, On the Number of Components for Some Parallel Communicating Grammar Systems. Theoretical Computer Science 387 (2007) 2, 136–146. 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. 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, Contextual grammars with subregular choice. Fundamenta Informaticae 64 (2005) 1–4, 109–118. 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, On the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems. Acta Cybernetica 17 (2005), 53–73. 2004 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, VICTOR MITRANA, GHEORGHE PAUN, 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. 2003 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. 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. BIANCA TRUTHE, On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems. Fundamenta Informaticae 56 (2003) 4, 389–409. 2002 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. HENNING FERNAU, RALF STIEBE, Sequential Grammars and Automata with Valences. Theoretical Computer Science 276 (2002) 1/2, 377–405. 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. 2001 JÜRGEN DASSOW, GHEORGHE PAUN, P systems with communication based on concentration. Acta Cybernetica 15 (2001) 1, 9–23. JÜRGEN DASSOW, GHEORGHE PAUN, GABRIEL THIERRIN, SHENG YU, Tree systems of morphisms. Acta Informatica 38 (2001) 2, 131–153. 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. 2000 HENNING BORDIHN, JÜRGEN DASSOW, GYÖRGY VASZIL, Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3 (2000), 1–20. HENNING BORDIHN, MARKUS HOLZER, Grammar systems with negated conditions in their cooperation protocols. Journal of Universal Computer Science 6 (2000) 12, 1165–1184. JÜRGEN DASSOW, CARLOS MARTÍN-VIDE, GHEORGHE PAUN, 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. 1999 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, HENNING FERNAU, GHEORGHE PAUN, 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 PAUN, On the regularity of duplication closure. Bulletin of the EATCS 69 (1999), 133–136. JÜRGEN DASSOW, GHEORGHE PAUN, Min of Mat is not necessarily Mat. Information Processing Letters 71 (1999) 5/6, 175–177. JÜRGEN DASSOW, GHEORGHE PAUN, On the power of membrane computing. Journal of Universal Computer Science 5 (1999) 2, 33–49. JÜRGEN DASSOW, GHEORGHE PAUN, On the regularity of languages generated by context-free evolutionary grammars. Discrete Applied Mathematics 92 (1999) 2/3, 205–209. 1998 JÜRGEN DASSOW, On special networks of parallel language processors. Romanian Journal of Information Sciences and Technologies 1 (1998), 331–341. JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PAUN, Convex and anti-convex languages. International Journal of Computer Mathematics 69 (1998), 1–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, GHEORGHE PAUN, Remarks on operations suggested by mutations in genomes. Fundamenta Informaticae 36 (1998), 183–200. 1997 JÜRGEN DASSOW, VICTOR MITRANA, Cooperation in context-free grammars. Theoretical Computer Science 180 (1997), 353–361. JÜRGEN DASSOW, VICTOR MITRANA, ARTO SALOMAA, Context-free evolutionary grammars and the structural language of nucleic acids. BioSystems 43 (1997) 3, 169–177. 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 via context condition grammars. Journal of Automata, Languages and Combinatorics 1 (1996) 2, 97–112. 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 PAUN, SORINA VICOLOV, On determinism in cooperating distributed grammar systems. Publicationes Mathematicae 48 (1996), 217–321. 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. 1995 JÜRGEN DASSOW, RUDOLF FREUND, GHEORGHE PAUN, Cooperating array grammar systems. Intern. J. Pattern Recognition and Artificial Intelligence 9 (1995), 1029–1053. JÜRGEN DASSOW, GHEORGHE PAUN, SORINA VICOLOV, On the generative capacity of certain classes of cooperating grammar systems. Fundamenta Informaticae 22 (1995), 217–226. HENNING FERNAU, HENNING BORDIHN, Remarks on accepting parallel systems. International Journal of Computer Mathematics 56 (1995), 51–67. 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 PAUN, Stratified grammar systems. Computers and Artificial Intelligence 13 (1994), 409–422. JÜRGEN DASSOW, MASAMI ITO, GHEORGHE PAUN, On the subword density of languages. Southeast Asian Bulletin of Mathematics 18 (1994), 49–61. 1993 MICEA ANDRASIU, JÜRGEN DASSOW, GHEORGHE PAUN, 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 PAUN, Cooperation in grammar systems: universality, similarity, timing. Kybernetika 36 (1993), 271–286. ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, GHEORGHE PAUN, Dynamically controlled cooperating/distributed grammar systems. Information Sciences 69 (1993), 1–25. 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 PAUN, On parallelism in colonies. Cybernetics and Systems 24 (1993), 37–49. JÜRGEN DASSOW, SOLOMON MARCUS, GHEORGHE PAUN, Iterated reading of numbers and `black-holes'. Periodica Math. Hungarica 27 (1993), 137–152. JÜRGEN DASSOW, VICTOR MITRANA, GHEORGHE PAUN, Szilard languages associated to cooperating distributed grammar systems. Stud. Cerc. Mat. 45 (1993), 403–413. JÜRGEN DASSOW, GHEORGHE PAUN, Cooperating/distributed grammar systems with regular components. Computers and Artificial Intelligence 12 (1993), 71–93. JÜRGEN DASSOW, GHEORGHE PAUN, ARTO SALOMAA, Grammars based on patterns. International Journal of Foundations in Computer Science 4 (1993) 1, 1–14. JÜRGEN DASSOW, GHEORGHE PAUN, ARTO SALOMAA, On the union of OL languages. Inform. Process. Letters 47 (1993), 59–63. JÜRGEN DASSOW, GHEORGHE PAUN, ARTO SALOMAA, On thinness and slenderness of L languages. Bulletin of the EATCS 49 (1993), 152–158. JÜRGEN DASSOW, GHEORGHE PAUN, SORINA VICOLOV, On the power of cooperating/distributed grammar systems with regular components. Foundations of Computing and Decision Sciences 18 (1993), 83–108. 1992 HENNING BORDIHN, Pure languages and the degree of nondeterminism. J. Inf. Process. Cybern. 28 (1992) 5, 231–240. 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, ALEXANDRU MATEESCU, GHEORGHE PAUN, 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, 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, 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, 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, GHEORGHE PAUN, 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, 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, GHEORGHE PAUN, Cooperating/distributed grammar systems with registers. Foundations of Control Engineering 15 (1990), 19–38. JÜRGEN DASSOW, GHEORGHE PAUN, On some variants of cooperating/distributed grammar systems. Stud. Cerc. Math. 42 (1990), 153–165. JÜRGEN DASSOW, GHEORGHE PAUN, On the degree of non-regularity of context-free languages. International Journal of Computer Mathematics 36 (1990), 13–29. 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. 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. 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. 1988 ERZSÉBET CSUHAJ-VARJÚ, JÜRGEN DASSOW, Message handling grammar systems. Papers on Automata and Formal Languages X (1988), 71–82. JÜRGEN DASSOW, A remark on limited OL systems. J. Inf. Process. Cybern. 24 (1988), 287–291. 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, 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. 1986 JÜRGEN DASSOW, Pure grammars with regulated rewriting. Revue Roumaine Math. Pures Appl. 31 (1986), 657–666. JÜRGEN DASSOW, GHEORGHE PAUN, Further remarks on pure grammars with regulated rewriting. Revue Roumaine Math. Pures Appl. 31 (1986), 855–864. JÜRGEN DASSOW, GHEORGHE PAUN, 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, On contextual grammar forms. International Journal of Computer Mathematics 17 (1985), 37–52. JÜRGEN DASSOW, GHEORGHE PAUN, Further remarks on the complexity of regulated rewriting. Kybernetika 21 (1985), 213–227. JÜRGEN DASSOW, GHEORGHE PAUN, 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 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 PAUN, Codings of pure languages obtained by regulated rewriting. Foundations of Control Engineering 3 (1984), 3–14. 1983 JÜRGEN DASSOW, A note on programmed OL systems. Information Sciences 30 (1983), 1–4. 1982 JÜRGEN DASSOW, A remark on a paper of My and Păun. Elektronische Informationsverarbeitung und Kybernetik 18 (1982), 67–68. 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, 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 PAUN, L(ET0L[5])=L(ET0L). Elektronische Informationsverarbeitung und Kybernetik 18 (1982), 345–348. 1981 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. 1977 JÜRGEN DASSOW, Einige Bemerkungen zu einem modifizierten Vollständigkeitsbegriff für Automatenabbildungen. Rostock. Math. Kolloq. 3 (1977), 69–84. 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.