Books and special issues

M. Droste, W. Kuich, H. Vogler (eds.): Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer-Verlag, 2009.
M. Ciric, M. Droste, J.-E. Pin (eds.): Special issue of Information and Computation. Selected papers from "Conference on Algebraic Informatics (CAI 2019)", vol. 301, 2024.
M. Droste, G. Rahonis, A. Salomaa (eds.): Special issue of International Journal of Foundations of Computer Science on "Recent Advances of Quantitative Models in Computer Science", in , vol.34, 2023.
M. Droste, P. Gastin, B. Monmege (eds.): Special issue of Information and Computation on "Weighted Automata: Theory and Applications" (Marseille, April 2021), in preparation.
M. Droste, A. Maletti, H. Vogler (eds.): Special issue of Information and Computation on "Weighted Automata: Theory and Applications" (Leipzig, May 2018), vol. 282, 2022.
A. Blass, P. Cegielski, N. Dershowitz, M. Droste, B. Finkbeiner (eds): Fields of Logic and Computation III, Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday, Lecture Notes in Computer Science, vol. 12180, Springer, 2020.
M. Ciric, M. Droste, J.-E. Pin (eds.): Conference on Algebraic Informatics (CAI 2019), Proceedings, Lecture Notes in Computer Science, vol. 11545, Springer, 2019.
M. Droste, I. Kotsireas, R. Rolland (eds.): Special issue of Theoretical Computer Science. Selected papers from "Conference on Algebraic Informatics (CAI 2017)", vol. 800, 2019.
M. Droste, Z. Esik, K. Larsen (eds.): Special issue of Soft Computing on "Quantitative Models and Weighted Automata", vol. 22, no. 4, 2018.
M. Droste, L. Fuchs, B. Goldsmith, L. Strüngmann (eds.): Groups, Modules and Model Theory - Surveys and Recent Developments, in Memory of Rüdiger Göbel, Springer, 2017.
M. Droste, H. Vogler (eds.): Special issue of Theoretical Computer Science, Workshop on "Weighted Automata: Theory and Applications" (Dresden, May 2012), vol. 534, 2014.
L. Strüngmann, M. Droste, L. Fuchs, K. Tent (eds.): Groups and Model Theory: A Conference in Honor of Rüdiger Göbel's 70th Birthday, Contemporary Mathematics, vol. 576, American Mathematical Society, 2012.
M. Droste, H. Vogler (eds.): Special issue of Acta Cybernetica, Workshop on "Weighted Automata: Theory and Applications" (Leipzig, May 2010), vol. 20, no. 2, 2011.
M. Droste, H. Vogler (eds.): Special issue of Acta Cybernetica, Workshop on "Weighted Automata: Theory and Applications" (Dresden, May 2008), vol. 19, no. 2, 2009.
M. Droste, H. Vogler (eds.): Special issue of Journal of Automata, Languages and Combinatorics, Workshop on "Weighted Automata: Theory and Applications" (Leipzig, March 2006), vol. 12, no. 4, 2007.
M. Droste, H. Vogler (eds.): Special issue of Journal of Automata, Languages and Combinatorics, Workshop on "Weighted Automata: Theory and Applications" (Dresden, June 2004), vol. 10, no. 2 & 3, 2005.

2024

G. Badia, M. Droste, C. Noguera, E. Paul: Logical characterizations of weighted complexity classes, in: Mathematical Foundations of Computer Science (MFCS 2024), LIPIcs, vol. 306, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, pp. 14:1-14:16.
M. Droste, H. Vogler: Run supports and initial algebra supports of weighted automata, submitted.
M. Droste, Z. Fülöp. A. Tepavcevic, H. Vogler: The generating power of weighted tree automata with initial algebra semantics, submitted.
M. Droste, W. Kuich: Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings, Theoretical Computer Science, 1002 (2024), online 114599.
M. Droste, G. Grabolle, G. Rahonis: Weighted linear dynamic logic, International Journal of Foundations of Computer Science 35 (2024), Issue No. 01n02, pp. 145-177.
A. Maletti, T. Nász, E. Paul: Weighted HOM-Problem for Nonnegative Integers, accepted for publication at STACS 2024.
E.Paul: Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata, International Journal of Foundations of Computer Science 35(1&2): 23–49.
E. Paul: Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (journal version), Theory of Computing Systems 68(4), Special issue of ICALP 2020, pp. 615–661.
Xiaoya Cheng, M. Droste, E. Paul, Yun Shang: Nivat's Theorem for Turing machines based on unsharp quantum logic, submitted.

2023

M. Droste, Z. Fülöp, D. Kószó: Decidability boundaries for the finite-image property of weighted finite automata, International Journal of Foundations of Computer Science 34 (2023), pp. 633 - 653.

2022

M. Droste, S. Dück, D. Mandrioli, M. Pradella: Weighted operator precedence languages, Information and Computation, 282 (2022), 104658 (26 pages). Special issue of WATA 2018.
M. Droste, S. Dziadek, W. Kuich: Greibach normal form for ω-algebraic systems and weighted simple ω-pushdown automata, Information and Computation 285 Part B (2022), 104871 (36 pages). arXiv:2007.08866
M. Droste, S. Dziadek, W. Kuich: Logic for ω-pushdown automata, Information and Computation, 282 (2022), 104659 (11 pages). Special issue of WATA 2018.
M. Droste, Z. Esik, W. Kuich: The triple-pair construction for weighted ω-pushdown automata, special issue of AFL 2017, International Journal of Foundations of Computer Science 33 (2022), pp. 227-246.
M. Droste, Z. Fülöp, D. Kószó, H. Vogler: Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, Theoretical Computer Science 919 (2022), pp. 118-143.

2021

M. Droste, D. Kuske: Weighted automata, chapter 4 (invited), in: Handbook of Automata Theory (J.-E. Pin, ed.), European Mathematical Society, pp. 113-150, 2021.
G. Grabolle: A Nivat theorem for weighted alternating automata over commutative semirings, in: Proceedings GandALF 2021, EPTCS 346, pp. 241-257, 2021.
E. Paul: Ausdrucksstäke gewichteter Automaten und Logiken, in: Ausgezeichnete Informatikdissertationen 2020 (Hölldobler, Steffen, ed.), volume D-21 of LNI, pages 249-258, GI, 2021.
E. Paul: Finite Sequentiality of Unambiguous Max-Plus Tree Automata (journal version), Theory of Computing Systems 65(4), Special issue of STACS 2019, pp. 736–776.

2020

S. Feng, C. Carapelle, O. Gil, K. Quaas: MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability, in: ACM transactions on computational logic, 21(2), 2020.
M. Fränzle, K. Quaas, M. Shirmohammadi, J. Worrell: Effective definability of the reachability relation in timed automata, in: Information Processing Letters 153, 105871, 2020.
M. Droste, S. Dziadek, W. Kuich: Nivat-theorem and logic for weighted pushdown automata on infinite words, in: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), LIPIcs, vol. 182, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 44:1-44:14, 2020.
M. Droste, Z. Fülöp, D. Kószó, H. Vogler: Crisp-determinizability of weighted tree automata over additively locally finite past-finite monotonic strong bimonoids is decidable, in: Descriptional Complexity of Formal Systems (DCFS 2020), LNCS, vol. 12442 Springer, 2020, pp. 39-51.
M. Droste, T. Kutsia, G. Rahonis, W. Schreiner: McCarthy-Kleene fuzzy automata and MSO logics, Information and Computation 272 (2020), 104499 (23 pages). Special issue of GandALF 2017.
E. Paul: Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata, in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Leibniz International Proceedings in Informatics, vol. 168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, pp. 137:1-137:15, Best Student Paper Track B.
E. Paul: Expressiveness and Decidability of Weighted Automata and Weighted Logics, Dissertation, Universität Leipzig, 2020.
E. Paul: Ausdrucksstärke gewichteter Automaten und Logiken. In Ausgezeichnete Informatikdissertationen 2020, volume D-21 of LNI, pp. 249–258. GI, 2020.
S.Dziadek: Weighted Logics and Weighted Simple Automata for Context-Free Languages of Infinite Words, Dissertation, Universität Leipzig, 2020.

2019

P. Babari, M. Droste: A Nivat theorem for weighted picture automata and weighted MSO logics, Journal of Computer and System Sciences 104 (2019), 41-57. Special issue of LATA 2015.
M.Berthold, R.Gonçalves, M.Knorr, J.Leite : A Syntactic Operator for Forgetting that Satisifes Strong Persistence [preprint]. Theory and Practice of Logic Programming 19 (5-6) (35th International Conference on Logic Programming), 2019, pp. 1038-1055.
M.Berthold, R.Gonçalves, M.Knorr, J.Leite: Forgetting in Answer-Set Programming with Anonymous Cycles. EPIA 2019: Progress in Artificial Intelligence, LNCS, vol. 11805, pp. 552-565.
B. Bollig, K. Quaas, A. Sangnier: The Complexity of Flat Freeze LTL. Logical Methods in Computer Science 15(3) (2019).
C. Diem, S. Kochinke: Ordinary plane models and completely split divisors (pdf), Preprint.
M. Droste, S. Dziadek, W. Kuich: Greibach normal form for ω-algebraic systems and weighted simple ω-pushdown automata, in: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), LIPIcs, vol. 150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, pp. 38:1-38:14.
M. Droste, S. Dziadek, W. Kuich: Weighted simple reset pushdown automata, Theoretical Computer Science 777 (2019), pp. 252-259.
M. Droste, P. Gastin: Aperiodic weighted automata and weighted first-order logic, in: Mathematical Foundations of Computer Science (MFCS 2019), LIPIcs, vol. 138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, pp. 76:1-76:15.
U. Fahrenberg, A. Legay, K. Quaas: Computing Branching Distances Using Quantitative Games. In: ICTAC 2019, LNCS, vol. 11884, pp. 59-75.
A. Mottet, K. Quaas: The containment problem for unambiguous register automata. STACS 2019, LIPIcs, vol. 126, pp. 53:1-53:15.
E. Paul: Finite sequentiality of unambiguous max-plus tree automata, in: Symposium on Theoretical Aspects of Computer Science (STACS 2019), LIPIcs, vol. 126, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, pp. 55:1-55:17.
K. Quaas, M. Shirmohammadi: Synchronizing Data Words for Register Automata. ACM Trans. Comput. Log. 20(2), pp. 11:1-11:27 (2019)
D. Götze, Z. Fülöp, M. Droste: A Kleene theorem for weighted tree automata over tree valuation monoids, Information and Computation 269 (2019), 104445 (17 pages). Special issue of LATA 2016.
L. Herrmann, H. Vogler, M. Droste: Weighted automata with storage, Information and Computation 269 (2019), 104447 (29 pages). Special issue of LATA 2016.
K. Quaas: Formal Verification of Infinite-State Systems: One-Counter Machines, Register Automata, and Timed Automata, Habilitationsschrift, Universität Leipzig, 2019.

2018

P. Babari, M. Droste, V. Perevoshchikov: Weighted register automata and weighted logic on data words, Theoretical Computer Science 744 (2018), pp. 3–21.
C. Diem, K. Schmeh: Gegen die Apokalypse -- Algorithmenwettbewerb zur Post-Quanten-Kryptographie, iX, 116-120, 06/2018.
M. Droste, W. Kuich: Weighted ω-restricted one counter automata, Logical Methods in Computer Science 14 (2018), pp. 1-14.
M. Droste, E. Paul: A Feferman-Vaught decomposition theorem for weighted MSO logic, in: Mathematical Foundations of Computer Science (MFCS 2018), LIPIcs, vol. 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, pp. 76:1-76:15.

2017

P. Babari: Quantitative Automata and Logic for Pictures and Data Words, Dissertation, Universität Leipzig, 2017.
B. Bollig, K. Quaas, A. Sangnier: The Complexity of Flat Freeze LTL. In 28th Int. Conference on Concurrency Theory (CONCUR 2017), 2017, pp. 33:1-33:16.
C. Carapelle, S. Feng, A. Kartzow, M. Lohrey: Satisfiability of ECTL* with Local Tree Constraints, Theory of Computing Systems, vol. 61(2), 2017, pp. 689-720.
M. Droste: On Ore's theorem and universal words for permutations and injections of infinite sets, in: Groups, Modules and Model Theory - Surveys and Recent Developments, in Memory of Rüdiger Göbel (eds. M. Droste, L. Fuchs, B. Goldsmith, L. Strüngmann), Springer, 2017, pp. 269-275.
M. Droste, S. Dück: Weighted automata and logics for infinite nested words, Information and Computation 253 (2017), pp. 448-466, Special Issue of LATA 2014.
M. Droste, S. Dück, D. Mandrioli, M. Pradella: Weighted operator precedence languages, in: Mathematical Foundations of Computer Science (MFCS 2017), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, vol. 83, 2017, pp. 31:1--31:15.
M. Droste, Z. Esik, W. Kuich: The triple-pair construction for weighted ω-pushdown automata, in: 15th International Conference on Automata and Formal Languages (AFL 2017), Electronic Proceedings in Theoretical Computer Science, vol. 252, 2017, pp. 101-113.
M. Droste, D. Götze: A Nivat theorem for quantitative automata on unranked trees, in: Models, Algorithms, Logics and Tools (eds. L. Aceto, G. Bacci, G. Bacci, A. Ingolfsdottir, A. Legay, R. Mardare), Lecture Notes in Computer Science, vol. 10460, Springer, 2017, pp. 22-35.
M. Droste, W. Kuich: A Kleene theorem for weighted ω-pushdown automata, Acta Cybernetica 23 (2017), special issue in memory of Zoltan Esik, pp. 43-59, invited paper.
M. Droste, T. Kutsia, G. Rahonis, W. Schreiner: MK-fuzzy automata and MSO logics, in: 8th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2017), Electronic Proceedings in Theoretical Computer Science 256 (2017), pp. 106-120.
S. Dück: Weighted Automata and Logics on Hierarchical Structures and Graphs, Dissertation, Universität Leipzig, 2017.
Z. Esik, U. Fahrenberg, A. Legay, K. Quaas: An Algebraic Approach to Energy Problems I. In Acta Cybern., 23(1), 2017, pp. 203-228.
Z. Esik, U. Fahrenberg and A. Legay, K. Quaas: An Algebraic Approach to Energy Problems II. In Acta Cybern., 23(1), 2017, pp. 229-268.
S. Feng, M. Lohrey, K. Quaas: Path Checking for MTL and TPTL. In Logical Methods in Comp. Science, 13(3), 2017.
D. Götze: Weighted Unranked Tree Automata over Tree Valuation Monoids, Dissertation, Universität Leipzig, 2017.
T. Heindel: The Chomsky-Schützenberger Theorem with Circuit Diagrams in the Role of Words, in: Abstract collection of the Twelfth International Tbilisi Symposium on Language, Logic and Computation
Yongming Li, M. Droste, Lihui Lei: Model checking of linear-time properties in multi-valued systems, Information Sciences 377 (2017), 51-74; DOI: 10.1016/j.ins.2016.10.030.
E. Paul: The equivalence, unambiguity and sequentiality problems of finitely ambiguous max-plus tree automata are decidable, in: Mathematical Foundations of Computer Science (MFCS 2017), LIPIcs, vol. 83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 53:1-53:13.
E. Paul: Monitor logics for quantitative monitor automata, in: Mathematical Foundations of Computer Science (MFCS 2017), LIPIcs, vol. 83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 14:1-14:13.
K. Quaas, M. Shirmohammadi, J. Worrell: Revisiting Reachability in Timed Automata. In Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017), 2017, pp. 1-12.

2016

P. Babari, M. Droste, V. Perevoshchikov: Weighted register automata and weighted logic on data words, in: International Colloquium on Theoretical Aspects of Computing (ICTAC 2016), Lecture Notes in Computer Science, vol. 9965 (2016), pp. 370-384. Best paper award.
P. Babari, K. Quaas, M. Shirmohammadi: Synchronizing data words for register automata, in: Mathematical Foundations of Computer Science (MFCS 2016), Leibniz International Proceedings in Informatics, vol. 58, no. 15 (2016), pp. 1-15.
P. Babari, N. Schweikardt: +Omega-picture languages recognizable by Büchi-tiling systems, in: Language and Automata Theory and Applications (LATA 2016), Lecture Notes in Computer Science, vol. 9618, Springer, 2016, pp. 76-88.
C. Carapelle, A. Kartzow, M. Lohrey: Satisfiability of ECTL* with Constraints, in: Journal of Computer and System Sciences, 82 (2016), 826 - 855.
M. Droste, Z. Fülöp, D. Götze: A Kleene theorem for weighted tree automata over tree valuation monoids, in: Language and Automata Theory and Applications (LATA 2016), Lecture Notes in Computer Science, vol. 9618, Springer, 2016, pp. 452-463.
M. Droste, W. Kuich: Zoltán Ésik (1951-2016) - in Memoriam. Journal of Automata, Languages and Combinatorics 21(3): 129-130 (2016).
M. Droste, V. Perevoshchikov: Multi-weighted automata and MSO logic, in: Theory of Computing Systems, 59 (2016), 231-261.
M. Droste, G. Rahonis: Weighted linear dynamic logic, International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016), Electronic Proceedings in Theoretical Computer Science 226, 2016, 149-163.
S. Dück: Weighted automata and logics on infinite graphs, in: 20th International Conference on Developments in Language Theory (DLT), Lecture Notes in Computer Science, vol. 9840, Springer, 2016, pp. 151-163.
E. Paul: On finite and polynomial ambiguity of weighted tree automata, in: 20th International Conference on Developments in Language Theory (DLT), Lecture Notes in Computer Science, vol. 9840, Springer, 2016, pp. 368-379.
H. Vogler, M. Droste, L. Herrmann: A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem, in: Language and Automata Theory and Applications (LATA 2016), Lecture Notes in Computer Science, vol. 9618, Springer, 2016, pp. 127-139.
T. Weidner: Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic, Dissertation, Universität Leipzig, 2016.

2015

P. Babari, M. Droste: A Nivat theorem for weighted picture automata and weighted MSO logics, in: Language and Automata Theory and Applications (LATA 2015), LNCS vol. 8977, Springer, 2015, pp. 703-715.
C. Carapelle, M. Lohrey: Temporal Logics with Local Constraints, Invited contribution, In: Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015.
C. Carapelle, S. Feng, A. Kartzow, M. Lohrey: Satisfiability of ECTL* with tree constraints, in: 10th International Computer Science Symposium in Russia (CSR 2015), volume 9139 of LNCS, pages 94-108. Springer, 2015.
M. Droste, S. Dück: Weighted automata and logics on graphs, in: 40th Conference on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 9234, Springer, 2015, pp. 192-204.
M. Droste, D. Heusel: The supports of weighted unranked tree automata, Fundamenta Informaticae 136 (2015), 37-58.
M. Droste, D. Heusel, H. Vogler: Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics, in: Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science, vol. 9270, Springer, 2015, pp. 90-102.
M. Droste, V. Perevoshchikov: A logical characterization of timed pushdown languages, in: 10th International Computer Science Symposium in Russia (CSR 2015), Lecture Notes in Computer Science, Springer, vol. 9139, 2015, pp. 189-203.
M. Droste, V. Perevoshchikov: Logics for weighted timed pushdown automata, in: Fields of Logic and Computation II, Gurevich Festschrift (L. Beklemishev, A. Blass, N. Dershowitz, B. Finkbeiner, W. Schulte, eds.), Lecture Notes in Computer Science, vol. 9300, Springer, 2015, pp. 153-173.
S. Feng, M. Lohrey, Karin Quaas: Path checking for MTL and TPTL over data words, in: 19th International Conference on Developments in Language Theory (DLT 2015), volume 9168 of LNCS, pages 326-339. Springer, 2015.
V. Perevoshchikov: Weight assignment logic, in: 19th International Conference on Developments in Language Theory (DLT 2015). Lecture Notes in Computer Science, vol. 9168, pages 413-425, Springer, 2015.
V. Perevoshchikov: Multi-Weighted Automata Models and Quantitative Logics, Dissertation, Universität Leipzig, 2015.
K. Quaas: Verification for Timed Automata Extended with Unbounded Discrete Data Structures in: Logical Methods in Computer Science 11(3), 2015.
T. Weidner: Probabilistic Regular Expressions and MSO Logic on Finite Tree, in: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), Leibniz International Proceedings in Informatics (LIPIcs), volume 45, pages, 503-516, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015.

2014

M. Droste, S. Dück: Weighted automata and logics for infinite nested words, in: Language and Automata Theory and Applications (LATA 2014), LNCS vol. 8370, Springer, 2014, pp. 323-334.
M. Droste, Z. Esik, W. Kuich: Conway and iteration hemirings, part 1, in: Int. J. of Algebra and Computation 24 (2014), 461-482.
M. Droste, Z. Esik, W. Kuich: Conway and iteration hemirings, part 2, in: Int. J. of Algebra and Computation 24 (2014), 483-513.
M. Droste, V. Perevoshchikov: A Nivat theorem for weighted timed automata and weighted relative distance logic, in: 35th Int. Colloq. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 8573, Springer, 2014, pp. 171-182.
M. Droste, B. Pibaljommee: Weighted nested word automata and logics over strong bimonoids, in: International Journal of Foundations of Computer Science 25 (2014), 641-666.
M. Droste, H. Vogler: The Chomsky-Schützenberger theorem for quantitative context-free languages, in: International Journal of Foundations of Computer Science 25 (2014), 955-969. Special issue of DLT 2013.
S. Feng, C. Carapelle, O. Fernandez Gil, K. Quaas: On the Expressiveness of TPTL and MTL over ω-Data Words, in: Int. Conference Automata and Formal Languages (AFL 2014), 5-18, EPTCS 145.
S. Feng, C. Carapelle, O. Fernandez Gil, K. Quaas: Satisfiability for MTL and TPTL over Non-monotonic Data Words, in: Language and Automata Theory and Applications (LATA 2014), LNCS vol. 8370 Springer, 2014, pp. 248-259.
I. Meinecke, K. Quaas: Parameterized Model Checking of Weighted Networks, in: Theor. Comput. Sci. 534: 69-85 (2014).
K. Quaas: Verification for Timed Automata extended with Unbounded Discrete Data Structures, in: CONCUR 2014, 512-526, LNCS vol. 8704, Springer.
K. Quaas: MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable, in: Workshopon Synthesis of Continuous Parameters (SynCop2014), 5-18, EPTCS 145, 2014.
T. Weidner: Probabilistic ω-Regular Expressions, in: Language and Automata Theory and Applications (LATA 2014), LNCS vol. 8370, Springer, 2014, pp. 588-600.

2013

G. Braun, S. Pokutta: Common information and unique disjointness, 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), angenommen; Electronic Colloquium on Computational Complexity (ECCC) 20: 56 (2013).
C. Carapelle, A. Kartzow, M. Lohrey: Satisfiability of CTL* with Constraints, in: Proc. of the 24th Int. Conf. on Concurrency Theory (CONCUR 2013), 2013.
M. Droste, R. Göbel: The normal subsemigroups of the monoid of injective maps, SemigroupForum 87 (2013), 298-312.
M. Droste, D. Götze: The support of nested weighted automata, in: Non-Classical Models of Automata and Applications (NCMA), Österreichische Computer Gesellschaft, 2013, pp. 101-116.
M. Droste, W. Kuich: Weighted finite automata over hemirings, Theoretical Computer Science 485 (2013), 38-48.
M. Droste, V. Perevoshchikov: Multi-weighted automata and MSO logic, in: 8th International Computer Science Symposium in Russia (CSR 2013), Lecture Notes in Computer Science, vol. 7913, Springer, 2013, pp. 418-430.
M. Droste, H. Vogler: The Chomsky-Schützenberger theorem for quantitative context-free languages, in 17th Int. Conf. on Developments in Language Theory (DLT), Lecture Notes in Computer Science, vol. 7907, Springer, 2013, pp. 203-214.
K. Quaas: Model Checking Metric Temporal Logic over Automata with one Counter. In Language and Automata Theory and Applications (LATA 2013), LNCS vol. 7810, Springer, 2013, pp468-479.
U. Fahrenberg, A. Legay, Z. Esik, K. Quaas: Kleene Algebras and Semimodules for Energy Problems., In Automated Technology for Verification and Analysis (ATVA 2014), LNCS vol. 8172, Springer, 2013, pp102-117.

2012

G. Braun, S. Pokutta: An algebraic approach to symmetric extended formulations, in: Intern. Symp. on Combinatorial Optimization (ISCO 2012), Lecture Notes in Computer Science, vol. 7422, 2012, pp. 141-152.
G. Braun, S. Fiorini, S. Pokutta, D. Steurer: Approximation limits of linear programs (beyond hierarchies), in: 53rd IEEE Symp. on Foundations of Computer Science (FOCS 2012), IEEE 2012, pp. 480-489.
G. Braun, S. Pokutta: Rigid abelian groups and the probabilistic method, Contemporary Mathematics 576 (2012), 17-30.
M. Droste, I. Meinecke: Weighted automata and weighted MSO logics for average- and longtime-behaviors, Information and Computation, 220-221 (2012), 44-59.
M. Droste, I. Meinecke, B. Seselja, A. Tepavcevic: Coverings and decompositions of semiring-weighted finite transition systems, in: Fuzzy Semirings with Applications to Automata Theory (by J. Ahsan, J. Mordeson, M. Shabir), chapter 11 (invited), Springer, 2012.
M. Droste, B. Pibaljommee: Weighted nested word automata and logics over strong bimonoids, in 17th International Conference on Implementation and Application of Automata (CIAA 2012), Lecture Notes in Computer Science, vol. 7381, Springer, 2012, pp. 138-148.
M. Droste, H. Vogler: Weighted automata and multi-valued logics over arbitrary bounded lattices, Theoret. Comp. Science 418 (2012), 14-36.
Th. Weidner: Probabilistic automata and probabilistic logic, in Mathematical Foundations of Computer Science 2012, Lecture Notes in Computer Science, vol. 7464, Springer, 2012, pp. 813-824.

2011

G. Braun, L. Strüngmann, Breaking upfinite automata presentable torsion-free abelian groups, IJAC (2011) no 8, 1463-1472.
G. Braun, S. Pokutta, Random half-integer polytopes, Operations Research Letters 39 (2011) no 3, 204-207.
G. Braun, J. Trlifaj: Strong submodules of almost projective modules, Pacific Journal of Mathematics 254 (2011) no. 1, 73-87.
M. Droste, V.V. Bludov, A.M.W. Glass: Automorphism groups of totally ordered sets: a retrospective survey, Mathematica Slovaca 61 (2011), 373-388.
M. Droste, R. Göbel: Countable random p-groups with prescribed Ulm-invariants, Proc. Amer. Math. Soc. 139 (2011), 3203-3216.
M. Droste, D. Götze, S. Märcker, I. Meinecke: Weighted tree automata over valuation monoids and their characterizations by weighted logics, in: Algebraic Foundations in Computer Science (eds. W. Kuich, G. Rahonis), Lecture Notes in Computer Sciences, vol. 7020, Springer, 2011, pp. 30-55.
M. Droste, I. Meinecke: Regular expressions on average and in the long run, in 15th International Conference on Implementation and Application of Automata (CIAA 2010), Lecture Notes in Computer Science vol.6482, Springer, 2011, pp. 211-221.
M. Droste, I. Meinecke: Weighted automata and regular expressions over valuation monoid, selected papers of CIAA 2010, Intern. J. of Foundations of Comp. Science 22 (2011), 1829-1844.
M. Droste, I. Meinecke, B. Seselja, A. Tepavcevic: A cascade decomposition of weighted finite transition systems, in: Non-Classical Models of Automata and Applications (NCMA 2011), Österreichische Computer Gesellschaft, 2011, pp. 137-152.
M. Droste, K. Quaas: A Kleene-Schützenberger theorem for weighted timed automata, Theoret. Comp. Science 412 (2011), 1140-1153.
M. Droste, J.K. Truss: The uncountable cofinality of the automorphism groupof the countable universal distributive lattice, Demonstratio Mathematica 44 (2011), 473-479.
M. Droste, H. Vogler: Weighted logics for unranked tree automata, Theory of Computing Systems 48 (2011), 23-47.
I. Fichtner: Weighted picture automata and weighted logics, Theory of Computing Systems 48 (2011), 48-78.
M. Huschenbett: Models for quantitative distributed systems and multi-valued logics, in: Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science vol. 6638, Springer, 2011, pp. 310-322.
H. Jänicke, T. Weidner, D. Chung, R.S. Laramee, P. Townsend, and M. Chen: Visual Reconstructability as a Quality Metric for Flow Visualization, Computer Graphics Forum (CGF), Vol. 30, No. 3, 2011, 781-790 (Proc. EuroVis 2011).
D. Kirsten: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybern. 20(2): 211-221 (2011).
D. Kuske and I. Meinecke: Construction of Tree Automata from Regular Expressions, RAIRO-Theor. Inf. Appl. 45(3): 347-370, 2011.
D. Kuske, T. Weidner: Size and Computation of Injective Tree Automatic Presentations, Mathematical Foundations of Computer Science (MFCS) 2011, 424-435, Springer Lecture Notes in Computer Science vol. 6907.
I. Meinecke: Valuations of weighted automata: Doing it in a rational way, In: W. Kuich, G. Rahonis (eds.). "Algebraic Foundations in Computer Science", Lecture Notes in Computer Sciences, vol. 7020, Springer, 2011, pp. 309-346.
K. Quaas, D. Kirsten: Recognizability of the Support of Recognizable Series over the Semiring of the Integers is Undecidable, in Information Processing Letters, 111(10), 2011, pp. 500-502.
K. Quaas: MSO Logics for Weighted Timed Automata. In Formal Methods in System Design, 38(3), 2011, pp. 193-222.
K. Quaas: On the Interval-Bound Problem for Weighted Timed Automata. In Language and Automata Theory and Applications (LATA 2011), Springer LNCS, Volume 6638 (2011), pp. 452-464.

2010

B. Bollig, D. Kuske, I. Meinecke: Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science, 6(3): 1-31, 2010.
G. Braun, S. Pokutta, Rank of random half-integral polytopes (extended abstract), Electronic Notes in Discrete Mathematics 36 (2010), 415-422.
M. Droste, M. Ciric, J. Ignjatovic, H. Vogler: Determinization of weighted finite automata over strong bimonoids, Information Sciences 180 (2010), 3497-3520.
M. Droste, I. Meinecke: Describing average- and longtime-behavior by weighted MSO logics, in: "Mathematical Foundations of Computer Science (MFCS)", Lecture Notes in Computer Science vol. 6281, Springer, 2010, pp. 537-548.
M. Droste, G. Rahonis: Weighted automata and weighted logics on infinite words, Izvestiya VUZ. Matematika 54 (2010), 26-45.
M. Droste, I. Rivin: On extension of coverings , Bull. London Math. Soc. 42 (2010), 1044-1054.
M. Droste, T. Stüber, H. Vogler: Weighted finite automata over strong bimonoids, Information Sciences 180 (2010), 156-166.
M. Droste, H. Vogler: Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices, in 14th Int. Conf. on Developments in Language Theory (DLT), Lecture Notes in Computer Science vol. 6224, Springer, 2010, pp. 160-172.
M. Droste, G.-Q. Zhang: Bifinite Chu spaces, Logical Methods in Computer Science vol.6, no.1, 2010, 1-20.
M. Huschenbett: A Kleene-Schützenberger theorem for trace series over bounded lattices, in: Non-Classical Models of Automata and Applications (NCMA), Österreichische Computer Gesellschaft, 2010, pp. 99-111.
D. Kirsten: On the Complexity of the Relative Inclusion Star Height Problem, Advances in Computer Science and Engineering 5 (2010), 173-211.
D. Kuske, M. Lohrey: Some natural problems in automatic graphs. Journal of Symbolic Logic 75(2) 678-710 (2010).
Ch. Mathissen: Transductions and Weighted Logics for Texts, Theoretical Computer Science , 411, issue 3 (2010), pp. 631-659.
K. Quaas: Kleene-Schützenberger and Büchi Theorems for Weighted Timed Automata, Dissertation, Universität Leipzig, 2010.

2009

M. Droste, W. Kuich, H. Vogler (eds.): Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer-Verlag, 2009.
M. Droste, H. Vogler (eds.): Special issue of Acta Cybernetica, Workshopon "Weighted Automata: Theory and Applications" (Dresden, May 2008), vol. 19, no. 2, 2009.
M. Droste, P. Gastin: Weighted automata and weighted logics, in: Handbook of Weighted Automata (M. Droste, W. Kuich, H. Vogler, eds.), EATCS Monographs in Theoretical Computer Science, chapter 5, Springer-Verlag, 2009.
M. Droste, R. Göbel: Stabilizers of direct composition series, Algebra Universalis 62 (2009), 209-237.
M. Droste, W. Kuich: Semirings and formal power series, in: Handbook of Weighted Automata (M. Droste, W. Kuich, H. Vogler, eds.), EATCS Monographs in Theoretical Computer Science, chapter 1, Springer-Verlag, 2009.
M. Droste, G. Rahonis: Weighted automata and weighted logics with discounting, Theoretical Computer Science 410 (2009), 3481-3494.
M. Droste, J.K. Truss: Uncountable cofinalities of automorphism groups of linear and partial orders, Algebra Universalis 62 (2009), 75-90.
D. Kirsten and S. Lombardy: Deciding Unambiguity and Sequentiality of Polynomially Ambiguous min-plus Automata, In S. Albers and J.-Y. Marion, editors, STACS'09 proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.
D. Kirsten: The Support of a Recognizable Series Over a Zero-sum Free, Commutative Semiring is Recognizable, In V. Diekert and D. Nowotka, editors, DLT'09, Proceedings, volume 5583 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2009.
D. Kirsten: An Algebraic Characterization of Semirings for which the Support of Every Recognizable Series is Recognizable, in R. Kralovic and D. Niwinski (eds.), MFCS'09, Proceedings, to appear in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2009.
D. Kuske: Weighted and unweighted trace automata. Acta Cybernetica 19 (2009) 393-410.
D. Kuske: Theories of automatic structures and their complexity, CAI 2009. 81-98, (c) Springer Lecture Notes in Computer Science vol. 5725 (2009).
D. Kuske, M. Lohrey: Automatic structures of bounded degree revisited. Computer Science Logic 2009, 364-378, Springer Lecture Notes in Computer Science vol. 5771 (2009).
D. Kuske, M.Lohrey: Hamiltonicity of automatic graphs, IFIpTCS 2008, 445-459, Springer (2009).
D. Kuske, I. Fichtner, I. Meinecke: Traces, series-parallel posets, and pictures: a weighted study. in: Handbook of Weighted Automata, 2009.
Ch. Mathissen: Weighted Automata and Weighted Logics over tree-like Structures, Dissertation, Universität Leipzig, 2009.
Ch. Mathissen: Existential MSO over Two Successors Is Strictly Weaker than over Linear Orders, Theoretical Computer Science, 410 (2009), pp. 3982-3987.
I. Meinecke: A weighted mu-calculus on words. In: "Developments in Language Theory (DLT 2009)", Lecture Notes in Computer Science, vol. 5583, Springer, 2009, pp. 384-395.
K. Quaas: Weighted Timed MSO Logics, in: Developments in Language Theory (DLT), Lecture Notes in Comp. Science vol. 5583, Springer 2009, pp. 419-430.
K. Quaas: On the Supports of Recognizable Timed Series, Formal Modelling and Analysis of Timed Systems (FORMATS 2009), 243-257, Springer LNCS, Volume 5813.

2008

M. Droste, P. Gastin: On aperiodic and star-free formal power series in partially commuting variables, Theory of Computing Systems 42 (2008), 608-631.
M. Droste, R. Göbel, S. Pokutta: Absolute graphs with prescribed endomorphism monoids, SemigroupForum 76 (2008), 256-267.
M. Droste, R. Gray, J.K. Truss Construction of some uncountable 2-arc-transitive bipartite graphs, Order 25 (2008), 349-357.
M. Droste, W. Kuich, G. Rahonis Multi valued MSO logics over words and trees, Fundamenta Informaticae 84 (2008), 305-327.
M. Droste, C. Holland, G. Ulbrich On full groups of measure-preserving and ergodic transformations with uncountable cofinalities, Bulletin London Math. Soc. 40 (2008), 463-472.
M. Droste, F. Huang, G.-Q. Zhang: A monoidal category of bifinite Chu spaces, in: 1st Int. Conf. on Foundations of Informatics, Computing and Software (FICS), Electronic Notes in Theoretical Computer Science 212 (2008), 285-297.
M. Droste, K. Quaas: A Kleene-Schützenberger theorem for weighted timed automata, in: 11th Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes in Comp. Science vol. 4962, Springer 2008, pp. 142-156.
M. Droste, J. Sakarovitch, H. Vogler: Weighted automata with discounting, Information Processing Letters 108 (2008), 23-28.
M. Droste, G. Zhang: Random event structures, International Journal of Software and Informatics 2 (2008), 77-88.
D. Kirsten: A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous min-plus-automata, RAIRO - Theoretical Informatics and Applications, special issue on "Journées Montoises d'Informatique Théorique 2006 (JM'06)", 42(3):553-581, 2008.
D. Kuske: Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic, STACS 2008, 467-478, IFIB Schloss Dagstuhl (2008).
D. Kuske: Schützenberger's theorem on formal power series follows from Kleene's theorem, Theoretical Computer Science 401 (2008) 243-248.
D.Kuske, B.Bollig: Distributed Muller automata and logics, Information and Computation 206 (2008) 1084-1094.
D. Kuske, M.Lohrey: Euler paths and ends in automatic and recursive graphs, Automata and Formal Languages 2008, 245-256, Hungarian Academy of Sciences (2008).
D. Kuske, M.Lohrey: Hamiltonicity of automatic graphs, IFIpTCS 2008, 445-459, Springer (2009).
D.Kuske, M.Lohrey: First-order and counting theories of ω-automatic struct ures, Journal of Symbolic Logic 73 (2008), 129-150.
D. Kuske, I.Meinecke: Construction of tree automata from regular expressions, Developments in language theory 2008, 491-503, Springer Lecture Notes in Computer Science vol. 5257 (2008).
Ch. Mathissen: Weighted logics for nested words and algebraic formal power series (pdf), Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP), Reykjavik. Part II.
Lecture Notes in Computer Science, vol. 5126, © Springer, 2008, pp. 221-232.
EATCS Award "Best student ICALppaper" (track B)

2007

M. Droste, H. Vogler (eds.): Special issue of Journal of Automata, Languages and Combinatorics, Workshopon "Weighted Automata: Theory and Applications" (Leipzig, March 2006), vol. 12 no. 4, 2007.
M.Droste, P. Gastin: Weighted automata and weighted logics, Theoret. Comp. Science (special issue of ICALp'05), 380 (2007), 69-86. Full version: pdf
M. Droste, Ch. Holland: Normal Subgroups of B_uAut(Ω), Applied Categorical Structures 15 (2007), 153-162.
M. Droste, D. Kuske: Almost every domain is universal, 23rd Conf. on the Mathematical Foundations of Programming Semantics (MFPS), Electronic Notes in Theoretical Computer Science vol. 173, 103-119 (2007).
M. Droste, U. Püschmann: On weighted Büchi automata with order-complete weights, Intern. J. of Algebra and Computation, 17 (2007), 235-260.
M. Droste, G. Rahonis: Weighted automata and weighted logics with discounting, 12th Int. Conf. on Implementation and Application of Automata (CIAA), Lecture Notes in Comp. Science vol. 4783, Springer 2007, pp. 73-84.
M. Droste, H. Vogler: Weighted logics for XML Full version: ps
M. Droste, G. Zhang: Bifinite Chu spaces, in: 2nd Conf. on Algebra and Coalgebra in Computer Science (CALCO), Lecture Notes in Comp. Science vol. 4624, Springer, 2007, pp. 179-193.
D. Kirsten: Desert Automata V. On the Complexity of the Relative Inclusion Star Height Problem, Manuscript, 2007, accepted at Advances in Computer Science and Engineering in 2009, to appear in 2010.
D. Kuske: Weighted asynchronous cellular automata, Theoretical Computer Science, 374 (2007), 127-148
B. Bollig, D. Kuske, I. Meinecke: Propositional Dynamic Logic for Message-Passing Systems, in: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007), Lecture Notes in Computer Science vol. 4855, Springer, 2007, pp. 303-315.
P. Gastin and D. Kuske: Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces, Fundamenta Informaticae 80, 169-197, 2007.
B. Genest, D. Kuske, A. Muscholl: On communicating automata with bounded channels, Fundamenta Informaticae 80, 147-167, 2007.
Ch. Mathissen: Definable Transductions and Weighted Logics for Texts, Proc. of the 11th Int. Conf. on Developments in Language Theory (DLT), Turku. Lecture Notes in Computer Science, vol. 4588, Springer, 2007, pp. 324-336.
I. Mäurer: Characterizations of Recognizable Picture Series, Theoretical Computer Science 374, pp. 214-228, 2007.
I. Meinecke, B. Bollig: Weighted Distributed Systems and Their Logics, In: "Symposium on Logical Foundations of Computer Science (LFCS 2007)", Lecture Notes in Computer Science, vol. 4514, Springer, 2007, pp. 54-68.

2006

M. Droste, J. Kari, P. Steinby: Observations on the smoothness properties of real functions computed by weighted finite automata, Fundamenta Informaticae, 73 (2006), 99-106.
M. Droste, D. Kuske: Skew and infinitary formal power series, Theoret. Comp. Science 366 (2006), 199-227.
M. Droste, G. Rahonis: Weighted automata and weighted logics on infinite words, 10th Int. Conf. on Developments in Language Theory (DLT), Lecture Notes in Computer Science vol. 4036, Springer, 2006, pp. 49-58.
M. Droste, J. Truss: On representing words in the automorphism groupof the random graph, Journal of GroupTheory 9, (2006) 815-836.
M. Droste, H. Vogler: Weighted tree automata and weighted logics, Theoret. Comp.Science 366 (2006), 228-247.
D.Kirsten: Distance Desert Automata and Star Height Substitutions. Habilitationsschrift, Universität Leipzig, Fakultät für Mathematik und Informatik, 2006.
D.Kuske: Theories of orders an the set of words. Theoretical Informatics and Applications 40 (2006), 53-74.
D. Kuske: Weighted asynchronous cellular automata STACS 2006, 685-696, © Springer Lecture Notes in Computer Science vol. 3884 (2006).
D. Kuske, E. Fohry: On graph products of automatic and biautomatic monoids. Semigroupforum 72 (2006), 337-352.
D.Kuske, B.Genest, A.Muscholl: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Information and Computation 204 (2006), 920-956.
D. Kuske, M. Lohrey: Monadic chain logic over iterations and applications to push-down systems. LICS 2006, 91-100, IEEE Computer Society (2006).
D. Kuske, M. Lohrey: Logical aspects of Cayley graphs: the monoid case. International Journal of Algebra and Computation 16 (2006), 307-340.
D. Kuske, M. Lohrey: First-order and counting theories of ω-automatic structures FoSSaCS 2006, 322-336, © Springer Lecture Notes in Computer Science vol. 3921 (2006).
I. Mäurer: Weighted Picture Automata and Weighted Logics. STACS 2006, LNCS 3884, pp. 313-324, Springer Berlin, 2006.
I. Meinecke: Weighted Logics for Traces. In: "Computer Science - Theory and Applications: First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg", LNCS 3976, Springer, 2006, pp. 235-246.
D. Kirsten: Distance Desert Automata and Star Height Substitutions, Habilitationsschrift, Universität Leipzig, 2006.

2005

M. Droste, H. Vogler (eds.): Special issue of Journal of Automata, Languages and Combinatorics, Workshopon "Weighted Automata - Theory and Applications" (Dresden, June 2004), vol. 10, no. 2 & 3, 2005.
M.Droste: Universal homogeneous causal sets, Journal of Mathematical Physics 46 (2005), 122503 1-10. Full version
M.Droste, P. Gastin: Weighted automata and weighted logics, Automata, Languages and Programming (32nd ICALP, Lissabon), Lecture Notes in Comp. Science, vol. 3580, Springer, 2005, pp. 513-525.
M. Droste, R. Göbel: Uncountable cofinalities of permutation groups, J. London Math. Soc. (2) 71 (2005), 335-344.
M. Droste, W.Ch. Holland: Generating automorphism groups of chains. Forum Mathematicum 17 (2005), 699-710.
M. Droste, C. Pech, H. Vogler: A Kleene theorem for weighted tree automata, Theory of Computing Systems, 38 (2005), 1-38.
D. Kuske, P. Gastin: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. CONCUR 2005, 533-547, © Springer Lecture Notes in Computer Science vol. 3653 (2005).
D.Kuske, B.Genest, A.Muscholl, D.Peled: Snapshot Verification. TACAS 2005, 510-525, © Springer Lecture Notes in Computer Science vol. 3440 (2005).
D. Kuske, M. Lohrey: Decidable first-order theories of one-steprewriting in trace monoids, Theory of Computing Systems 38 (2005), 39-81.
D.Kuske, M.Lohrey: Logical aspects of Cayley graphs: the groupcase. Annals of Pure and Applied Logic 131 (2005), 263-286.
I. Mäurer: Recognizable and Rational Picture Series. Conference on Algebraic Informatics, Thessaloniki. 2005
I. Mäurer, D. Kirsten: On the Determinization of Weighted Automata Journal of Automata, Languages and Combinatorics, Special issue "Selected papers of the workshopWeighted Automata: Theory and Applications (Dresden, June 1-5 2004)"; Vol. 10 (2005) Number 2.
I. Meinecke: The Hadamard Product of Sequential-Parallel Series. Journal of Automata, Languages and Combinatorics, Special issue "Selected papers of the workshopWeighted Automata: Theory and Applications (Dresden, June 1-5 2004)"; Vol. 10 (2005) Number 2.

2004

D.Kuske, B. Genest, A. Muscholl: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (invited talk by A. Muscholl). DLT 2004. 30-48, © Springer Lecture Notes in Computer Science vol. 3340 (2004).
D.Kuske, I.Meinecke: Branching automata with costs - a way of reflecting parallelism in costs. Theoretical Computer Science 328 (2004), 53-75.
D.Kuske, P.Weigelt: The rôle of the complementarity relation in Watson-Crick automata and sticker systems. DLT 2004, 272-283, Springer Lecture Notes in Computer Science vol. 3340 (2004).
I.Meinecke: Weighted Branching Automata - Combining Concurrency and Weights. Dissertation, TU Dresden.

Publikationen

Books and special issues

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004