# Manfred Droste

Books  |  Monographs  |  Algebra  |  Theoretical computer science  |

Books and special journal issues (editor)

• Semantics of Programming Languages and Model Theory
(ed. with Y. Gurevich), Proc. of a conference at the IBFI, Schloß Dagstuhl 1991,
Gordon and Breach Science Publ., OPA (Amsterdam), 1993

• Advances in Algebra and Model Theory: Selected surveys presented at
conferences in Essen 1994 and Dresden 1995
(ed. with R. Göbel), series "Algebra, Logic and Applications", Gordon and Breach Science Publ., 1997.

• Contributions to General Algebra, vol. 13 (ed. with I. Chaida, G. Eigenthaler, W.B. Müller, R. Pöschel),
Proc. of the 60th AAA, Verlag J. Heyn, Klagenfurt, 2001.

• Special issue of Journal of Automata, Languages and Combinatorics (ed. with P. Gastin), Workshop on "Logic and Algebra in Concurrency"
(Dresden, Sep. 2000), vol. 7, no. 2, 2002.

• Special issue of Journal of Automata, Languages and Combinatorics (ed. with H. Vogler), Workshop on "Weighted Automata: Theory and Applications"
(Dresden, March 2002), vol. 8, no. 3, 2003.

• Special issue of Journal of Automata, Languages and Combinatorics (ed. with H. Vogler), Workshop on "Weighted Automata: Theory and Applications"
(Dresden, June 2004), vol. 10, no. 2 & 3, 2005.

• Special issue of Journal of Automata, Languages and Combinatorics (ed. with H. Vogler), Workshop on "Weighted Automata: Theory and Applications"
(Leipzig, March 2006), vol. 12 no. 4, 2007.

• Special issue of Acta Cybernetica (ed. with H. Vogler), Workshop on "Weighted Automata: Theory and Applications" (Dresden, May 2008), vol. 19, no. 2, 2009.

• Handbook of Weighted Automata (ed. with W. Kuich, H. Vogler), EATCS Monographs in Theoretical Computer Science, Springer-Verlag, 2009.

• Special issue of Acta Cybernetica (ed. with H. Vogler), Workshop on "Weighted Automata: Theory and Applications"
(Leipzig, May 2010), vol. 20, no. 2, 2011.

• Groups and Model Theory: A Conference in Honor of Rüdiger Göbel's 70th Birthday (ed. with L. Strüngmann, L. Fuchs, K. Tent),
Contemporary Mathematics, vol. 576, American Mathematical Society, 2012.

• Special issue of Theoretical Computer Science (ed. with H. Vogler),
Workshop on "Weighted Automata: Theory and Applications" (Dresden, May 2012), vol. 534, 2014.

• Quantitative Models and Weighted Automata (ed. with Z. Esik and K. Larsen), Special issue of Soft Computing vol. 22, no. 4, 2018.

• Groups, Modules and Model Theory - Surveys and Recent Developments, in Memory of Rüdiger Göbel (ed. with L. Fuchs, B. Goldsmith, L. Strüngmann),
Springer, 2017.
• Special issue of Theoretical Computer Science (ed. with I. Kotsireas, R. Rolland), Selected papers from Conference on Algebraic Informatics (CAI 2017),
in preparation.
• Special issue of Information and Computation on "Weighted Automata: Theory and Applications", (ed. with A. Maletti, H. Vogler), in preparation.
• Conference on Algebraic Informatics (CAI 2019), Proceedings,
(ed. with M. Ciric, J.-E. Pin), Lecture Notes in Computer Science, Springer, planned.
• Special issue of Information and Computation. (ed. with M. Ciric, J.-E. Pin), Selected papers from "Conference on Algebraic Informatics (CAI 2019)", planned.

Monograph

1. Structure of partially ordered sets with transitive automorphism groups. ABSTRACT
Memoirs Amer. Math. Soc. 334 (1985); reprint and update, in preparation

Algebra

1. On a theorem of Baer, Schreier and Ulam for permutations (with R. Göbel). J. Algebra 58 (1979), 282 - 290.

2. Über k-homogene unendliche Permutationsgruppen. Archiv Math. 34 (1980), 494 - 495.

3. Products of conjugate permutations. ABSTRACT (with R. Göbel), Pacific J. Math. 94 (1981), 47 - 60.

4. Wechselwirkung der algebraischen Struktur transitiver Automorphismengruppen mit der Geometrie ihres Operationsbereiches.
Dissertation, Universität GHS Essen, 1982.

5. Products of conjugacy classes of the infinite symmetric group. ABSTRACT Discrete Math. 47 (1983), 35 - 48.

6. On an extendability problem for measures. manuscripta math. 48 (1984), 251 - 254.

7. Cubes of conjugacy classes covering the infinite symmetric group. ABSTRACT Trans. Amer. Math. Soc. 288 (1985), 381 - 393.

8. Classes of universal words for the infinite symmetric group, Algebra Universalis 20 (1985), 205 - 216.

9.  Normal subgroups of doubly transitive automorphism groups of chains. ABSTRACT (with R.N. Ball), Trans. Amer. Math. Soc. 290 (1985), 647 - 664.

10. A construction of all normal subgroup lattices of 2-transitive automorphism groups of linearly ordered sets. ABSTRACT
(with S. Shelah), Israel J. Math. 51 (1985), 223 - 261.

11. The normal subgroup lattice of 2-transitive automorphism groups of linearly ordered sets. ABSTRACT Order 2 (1985), 291 - 319.

12. On the universality of words for the alternating groups. ABSTRACT Proc. Amer. Math. Soc. 96 (1986), 18 - 22.

13. Complete embeddings of linear orderings and embeddings of lattice-ordered groups. ABSTRACT Israel J. Math. 56 (1986), 315 - 334.

14. Partially ordered sets with transitive automorphism groups. ABSTRACT Proc. London Math. Soc. 54 (1987), 514 - 543.

15. On the universality of systems of words in permutation groups. ABSTRACT (with S. Shelah), Pacific J. Math. 127 (1987), 321 - 328.

16. Completeness properties of certain normal subgroup lattices. ABSTRACT European J. Combinatorics 8 (1987), 129 - 137

17. Squares of conjugacy classes in the infinite symmetric groups. ABSTRACT Trans. Amer. Math. Soc. 303 (1987), 503 - 515.

18. Symmetrieverhalten von geordneten Strukturen und Blackwellschen Meßräumen, Schrift zur Habilitation, Universität GHS Essen, 1988.

19. Normal subgroups and elementary theories of lattice-ordered groups. ABSTRACT Order 5 (1988), 261 - 273.

20. Super-rigid families of strongly Blackwell spaces. ABSTRACT Proc. Amer. Math. Soc. 103 (1988), 803 - 808.

21. The existence of rigid measurable spaces. ABSTRACT Topology and its Applications 31 (1989), 187 - 195.

22. K-homogeneous relations and tournaments, Quarterly J. Math. Oxford (2) 40 (1989), 1 - 11.

23. Automorphism groups of infinite semilinear orders (I). ABSTRACT (with W.C. Holland, D. Macpherson),
Proc. London Math. Soc. 58 (1989), 454 - 478.

24. Automorphism groups of infinite semilinear orders (II). ABSTRACT (with W.C. Holland, D. Macpherson),
Proc. London Math. Soc. 58 (1989), 479 - 494.

25. Embeddings into simple lattice-ordered groups with different first order theories. ABSTRACT (with M. Giraudet), Forum Mathematicum 1 (1989), 315 - 321.

26. The root system of prime subgroups of free lattice-ordered groups (without G.C.H.). ABSTRACT (with S.H. McCleary), Order 6 (1989), 305 - 309.

27. On k-homogeneous posets and graphs. ABSTRACT (with D. Macpherson), J. Combinatorial Theory Ser. A 56 (1991), 1 - 15.

28. Automorphism groups of homogeneous semilinear orders: Normal subgroups and commutators. (with W.C. Holland, D. Macpherson),
Canadian J. Math. 43 (1991), 721 - 737.

29. Commutators in groups of order-preserving permutations. (with R. Shortt), Glasgow Math. J. 33 (1991), 55 - 59.

30. Subgroups of small index in ordered permutation groups. (with J.K. Truss), Quart. J. Math. Oxford (2) 42 (1991), 31 - 47.

31. A categorical theorem of universal objects and its applications in abelian group theory and computer science
(with R. Göbel), in: "Algebra and Logic" Proc., conf. in honor of A.I. Maltsev, Novosibirsk 1989,
Contemp. Math. 131 (1992), 49 - 74.

32. Representations of free lattice-ordered groups. ABSTRACT Order 10 (1993), 375 - 381.

33. Set-homogeneous graphs. ABSTRACT (with M. Giraudet, D. Macpherson, N. Sauer), J. Combinatorial Theory Ser. B, 62 (1994), 63 - 95.

34. Periodic ordered permutation groups and cyclic orderings (with M. Giraudet, D. Macpherson), J. Combinatorial Theory Ser. B, 63 (1995), 310 - 321.

35. McLain groups over arbitrary rings and orderings (with R. Göbel), Math. Proc. Camb. Philos. Soc. 117 (1995), 439 - 467.

36. The automorphism groups of generalized McLain groups (with R. Göbel), in: "Ordered Groups and Infinite Permutation groups" (W.C. Holland, ed.),
Kluwer Academic Publishers, 1995, pp. 97 - 120.

37. The automorphism groups of Hahn-groups (with R. Göbel), in: "Ordered Algebraic Structures" (W.C. Holland, J. Martinez, ed.),
Kluwer Academic Publishers, 1997, pp. 183 - 215.

38. Set-homogeneous graphs and embeddings of total orders. ABSTRACT (with M. Giraudet, D. Macpherson), Order 14 (1997), 9 - 20.

39. Simple automorphism groups of cycle-free partial orders. ABSTRACT (with J.K. Truss, R. Warren),
Forum Mathematicum 11 (1999), 279 - 294.

40. On homogeneous semilattices and their automorphism groups. ABSTRACT (with D. Kuske, J.K. Truss), Order 16 (1999), 31 - 56.

41. The automorphism group of the universal distributive lattice. ABSTRACT (with D. Macpherson), Algebra Universalis 43 (2000), 295 - 306.

42. Complementary closed rational clones are not always Krasner clones. ABSTRACT (with D. Kuske, R. McKenzie, R. Pöschel),
Algebra Universalis 45 (2001), 155 - 160.

43. Rigid chains admitting many embeddings. ABSTRACT (with J.K. Truss), Proc. Amer. Math. Soc. 129 (2001), 1601 - 1608.

44. All groups are outer automorphism groups of simple groups. ABSTRACT (with M. Giraudet, R. Göbel), Journal London Math. Soc. 64 (2001), 565 - 575.

45. On the homeomorphism groups of Cantor's discontinuum and the spaces of rational and of irrational numbers. ABSTRACT (with R. Göbel),
Bull. London Math. Soc. 34 (2002), 474 - 478.

46. Outer automorphism groups of ordered permutation groups. ABSTRACT (with S. Shelah), Forum Mathematicum 14 (2002), 605 - 621.

47. Uncountable homogeneous partial orders,
(with D. Macpherson, A Mekler) Mathematical Logic Quarterly 48 (2002), 525 - 532.

48. On random relational structures. ABSTRACT (with D. Kuske), Journal of Combinatorial Theory - Series A, 102 (2003), 241 - 254.

49. Generating automorphism groups of chains. ABSTRACT (with W. Ch. Holland),  Forum Mathematicum 17 (2005), 699-710.

50. Uncountable cofinalities of permutation groups. ABSTRACT (with R. Göbel), J. London Math. Soc. (2) 71 (2005), 335-344.

51. On representing words in the automorphism group of the random graph.
(with J. Truss), Journal of Group Theory 9 (2006) 815-836.

52. Normal Subgroups of BuAut(Ω). ABSTRACT (with W.Ch. Holland), Applied Categorical Structures 15 (2007), 153-162.

53. Absolute graphs with prescribed endomorphism monoids. ABSTRACT (with R. Göbel, S. Pokutta), Semigroup Forum 76 (2008), 256-267.

54. Construction of some uncountable 2-arc-transitive bipartite graphs. ABSTRACT (with R.Gray, J.K.Truss), Order 25 (2008), 349-357.

55. On full groups of measure-preserving and ergodic transformations with uncountable cofinalities. ABSTRACT (with C.Holland, G.Ulbrich),
Bulletin London Math. Soc. 40 (2008), 463-472.

56. Stabilizers of direct composition series. ABSTRACT (with R. Göbel), Algebra Universalis 62 (2009), 209-237.

57. Uncountable cofinalities of automorphism groups of linear and partial orders. ABSTRACT (with J.K. Truss), Algebra Universalis 62 (2009), 75-90.

58. On extension of coverings. ABSTRACT (with I. Rivin), Bull. London Math. Soc. 42 (2010), 1044-1054.

59. Automorphism groups of totally ordered sets: a retrospective survey. ABSTRACT (with V. Bludov, A.M.W. Glass), Mathematica Slovaca 61 (2011), 373-388.

60. Countable random p-groups with prescribed Ulm-invariants. (with R. Göbel), Proc. Amer. Math. Soc. 139 (2011), 3203-3216.

61. The uncountable cofinality of the automorphism group of the countable universal distributive lattice
(with J.K. Truss), Demonstratio Mathematica 44 (2011), 473-479.

62. The normal subsemigroups of the monoid of injective maps. ABSTRACT (with R. Göbel), Semigroup Forum 87 (2013), 298-312.

63. 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.

Theoretical computer science

1. Event structures and domains. ABSTRACT Theoret. Comp. Sci.68 (1989), 37 - 47.

2. Recursive domain equations for concrete data structures. ABSTRACT Information and Computation 82 (1989), 65 - 80.

3. Non-deterministic information systems and their domains. ABSTRACT (with R. Göbel), Theoret. Comp. Sci. 75 (1990), 289 - 309.

4. Effectively given information systems and domains (with R. Göbel), in: "Computer Science Logic", Proc.  Kaiserslautern 1989,
Lecture Notes in Comp. Science 440, Springer, 1990, pp. 116 - 142.

5. Universal domains in the theory of denotational semantics of programming languages. (with R. Göbel),
in: 5th IEEE Symp. on "Logic in Computer Science" (LICS),
Philadelphia, 1990, IEEE Computer Society Press, pp. 19 - 34.

6. Concurrency, automata and domains. ABSTRACT, in: Automata, Languages and Programming (17th ICALP, Warwick),
Lecture Notes in Comp. Science 443, Springer, 1990, pp. 195 -208.

7. Universal homogeneous event structures and domains. ABSTRACT Information and Computation 94 (1991), 48 - 61.

8. Universal information systems. ABSTRACT (with R. Göbel), Intern. J. of Foundations of Comp. Science 1 (1991), 413 - 424.

9. Finite axiomatizations for universal domains. ABSTRACT J. of Logic and Computation 2 (1992), 119 - 131.

10. Concurrent automata and domains. ABSTRACT Intern. J. of Foundations of Comp. Science 3 (1992), 389 - 418.

11. Bounded Petri nets of finite dimension have only finitely many reachable markings (with R. Shortt),
Bull. Europ. Assoc. for Theoret. Comp. Science 48 (1992), 172 - 175.

12. On stable domains, Theoret. Comp. Science 111 (1993), 89 - 101.

13. Universal domains and the amalgamation property. ABSTRACT (with R. Göbel), Mathem. Structures in Comp. Science 3 (1993), 137 - 159.

14. Petri nets and automata with concurrency relations - an adjunction. ABSTRACT (with R. Shortt),
in: Semantics of Programming Languages and Model Theory
(M. Droste, Y. Gurevich, eds.), Gordon and Breach Science Publ.,
OPA (Amsterdam), 1993, pp. 69 - 87.

15. From domains to automata with concurrency (with F. Bracho), in: Automata, Languages and Programming (20th ICALP, Lund),
Lecture Notes in Comp. Science 700, Springer, 1993, pp. 669 - 681.

16. Labelled domains and automata with concurrency.  ABSTRACT (with F. Bracho), Theoret. Comp. Science 135 (1994), 289 - 318.

17. A Kleene theorem for recognizable languages over concurrency monoids. ABSTRACT, in: Automata, Languages and Programming (21st ICALP, Jerusalem),
Lecture Notes in Comp. Science 820, Springer, 1994, pp. 388 - 399.

18. Recognizable languages in concurrency monoids. ABSTRACT Theoret. Comp. Science 150 (1995), 77 - 108.

19. Dependence orders for computations of concurrent automata. ABSTRACT (with F. Bracho, D. Kuske), in: STACS '95,
Lecture Notes in Comp. Science 900, Springer, 1995, pp. 467 - 478.

20. Languages and logical definability in concurrency monoids. ABSTRACT (with D. Kuske), in: Computer Science Logic, Paderborn 1995,
Lecture Notes in Comp. Science 1092, Springer, 1996, pp.233 - 251.

21. Aperiodic languages in concurrency monoids. ABSTRACT Information and Computation 126 (1996), 105 - 113.

22. Trace languages definable with modular quantifiers. ABSTRACT (with D. Kuske), in: Developments in Language Theory, 2nd Int. Conf., Magdeburg,
World Scientific Publ., 1996, pp. 386 - 395.

23. Asynchronous cellular automata for pomsets without autoconcurrency. ABSTRACT (with P. Gastin),
in: 7th Int. Conf.  on Concurrency Theory (CONCUR, Pisa),
Lecture Notes in Comp. Science 1119, Springer, 1996, pp. 627 - 638.

24. Representation of computations in concurrent automata by dependence orders. ABSTRACT (with F. Bracho, D. Kuske),
Theoret. Comp. Science 174 (1997), 67 - 96.

25. On recognizable and rational formal power series in partially commuting variables. ABSTRACT
(with P. Gastin), in: Automata, Languages and Programming (24th ICALP, Bologna), Lecture Notes in Comp. Science 1256, Springer, 1997, pp. 682 - 692.

26. Recognizable and locally definable languages of infinite computations in concurrent automata. ABSTRACT (with D. Kuske),
Intern. J. of Foundations of Comp. Science 9 (1998), 295 - 313.

27. Temporal logics for computations in concurrency monoids. (with D. Kuske), Preprint.

28. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. ABSTRACT (with P. Gastin),
Information and Computation 153 (1999), 47 - 80.

29. On recognizable languages in divisibility monoids. ABSTRACT (with D. Kuske), in: 12th Int. Symp. on Fundamentals of Computation Theory (FCT, Iasi),
Lecture Notes in Comp. Science, Springer 1684, 1999, pp. 246 - 257.

30. Asynchronous cellular automata for pomsets. ABSTRACT (with P. Gastin, D. Kuske), Theoret. Comp. Science 247 (2000), 1 - 38 (fundamental study).

31. On aperiodic and star-free formal power series in partially commuting variables. ABSTRACT (with P. Gastin),
in: Formal Power Series and Algebraic Combinatorics
(D. Krob, A.A. Mikhalev, A.V. Mikhalev, eds.), 12th Int. Conf., Moscow,
Springer, 2000, pp. 158 - 169.

32. Recognizable languages in divisibility monoids. ABSTRACT (with D. Kuske), Mathem. Structures in Comp. Science 11 (2001), 743 - 770.

33. Rational transformations of formal power series. ABSTRACT (with G.-Q. Zhang), in: Automata, Languages and Programming (28th ICALP, Crete),
Lecture Notes in Comp. Science 2076, Springer 2001, 555 - 566.

34. Continuous Petri nets and transition systems. ABSTRACT (with R.M. Shortt), in: Unifying Petri Nets (H. Ehrig, G. Juhas, J. Padberg, G. Rozenberg, eds.)
Lecture Notes in Computer Science 2128, Springer, 2001, pp. 457 - 484; invited contribution.

35. Universal homogeneous graph-like structures and domains. ABSTRACT (with P. Boldi, F. Cardone), Mathem. Structures in Comp. Science, 12 (2002), 91 - 109.

36. From Petri nets to automata with concurrency. ABSTRACT
(with R.M. Shortt), Applied Categorical Structures 10 (2002), 173 - 191.

37. Automata with concurrency relations - a survey. ABSTRACT (with D. Kuske), in: Advances in Logic, Artificial Intelligence und Robotics
(eds. J. Abe, J. da Silva Filho), IOS Press, 2002, pp. 152 - 172; invited survey.

38. Skew and infinitary formal power series. ABSTRACT (with D. Kuske), in: Automata Languages and Programming (30th ICALP, Eindhoven)
Lecture Notes in Computer Science 2719, 2003, pp. 426 - 438.

39. On minimal event  and concrete data structures. (with F. Bracho, I. Meinecke), in: Domains, Logic and Computation
(eds. J. Lawson, G.-Q.  Zhang, Y.-M. Liu, M.-K. Luo), Semantic Structures in Computation, vol. 3, Kluwer Academic Publ., 2003, pp. 161 - 178.

40. On transformations of  formal power series.
(with G.-Q. Zhang), Information and Computation, 184 (2003), 369 - 383.

41. A Kleene theorem for weighted tree automata. ABSTRACT (with C. Pech, H. Vogler),  Theory of Computing Systems, 38 (2005), 1-38.

42. Weighted automata and weighted logic. ABSTRACT (with P. Gastin), in: Automata, Languages and Programming (32nd ICALP, Lissabon),
Lecture Notes in Comp. Science vol. 3580, Springer, 2005, pp. 513-525.

43. Observations on the smoothness properties of real functions computed by weighted finite automata. (with J. Kari, P. Steinby),
Fundamenta Informaticae, 73 (2006), 99-106.

44. Skew and infinitary formal power series ABSTRACT (with D. Kuske), Theoret. Comp. Science 366 (2006), 199-227.

45. Weighted tree automata and weighted logics ABSTRACT (with H. Vogler), Theoret. Comp.Science 366 (2006), 228-247.

46. Weighted automata and weighted logics on infinite words. ABSTRACT (with G.Rahonis),
in: 10th Int. Conf. on Developments in Language Theory (DLT), Lecture Notes in Computer Science vol. 4036, Springer, 2006, pp. 49-58.

47. Weighted automata and weighted logics ABSTRACT (with P. Gastin), Theoretical Computer Science (special issue of ICALP '05), 380 (2007), 69-86

48. On weighted Büchi automata with order-complete weights ABSTRACT (with U. Püschmann), Intern. J. of Algebra and Computation, 17 (2007), 235-260.

49. Almost any domain is universal. ABSTRACT (with D. Kuske), in: 23rd Conf. on the Mathematical Foundations of Programming Semantics (MFPS),
Electronic Notes in Theoretical Computer Science vol. 173, 103-119 (2007).

50. Bifinite Chu spaces. ABSTRACT (with G.-Q. Zhang), in: 2nd Conf. on Algebra and Coalgebra in Computer Science (CALCO),
Lecture Notes in Comp. Science vol. 4624, Springer, 2007, pp. 179-193.

51. Weighted automata and weighted logics with discounting. ABSTRACT (with G. Rahonis), in: 12th Int. Conf. on Implementation and Application of Automata (CIAA),
Lecture Notes in Comp. Science vol. 4783, Springer 2007, pp. 73-84.

52. On aperiodic and star-free formal power series in partially commuting variables. ABSTRACT(with P. Gastin), Theory of Computing Systems 42 (2008), 608-631.

53. Multi-valued MSO logics over words and trees. ABSTRACT(with W. Kuich, G. Rahonis), Fundamenta Informaticae 84 (2008), 305-327.

54. Random event structures. ABSTRACT(with G.-Q. Zhang), International Journal of Software and Informatics 2 (2008), 77-88.

55. A Kleene-Schützenberger Theorem for Weighted Timed Automata. ABSTRACT(with K.Quaas),
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.

56. Weighted automata with discounting. (with J. Sakarovitch, H. Vogler), Information Processing Letters 108 (2008), 23-28.

57. A monoidal category of bifinite Chu spaces. (with F. Huang, G.-Q. Zhang),
1st Int. Conf. on Foundations of Informatics, Computing and Software (FICS), Electronic Notes in Theoretical Computer Science 212 (2008), 285-297p;

58. Weighted automata and weighted logics with discounting. (with G. Rahonis), Theoretical Computer Science 410 (2009), 3481-3494.

59. Semirings and formal power series. (with W. Kuich), in: Handbook of Weighted Automata (M. Droste, W. Kuich, H. Vogler, eds.),
EATCS Monographs in Theoretical Computer Science, chapter 1, Springer-Verlag, 2009.

60. Weighted automata and weighted logics. (with P. Gastin),
in: Handbook of Weighted Automata (M. Droste, W. Kuich, H. Vogler, eds.),
EATCS Monographs in Theoretical Computer Science, chapter 5, Springer-Verlag, 2009.

61. Weighted finite automata over strong bimonoids. ABSTRACT(with T. Stüber, H. Vogler), Information Sciences 180 (2010), 156-166.

62. Bifinite Chu spaces. (with G.-Q. Zhang), Logical Methods in Computer Science 6 (2010), 1-20.

63. Weighted automata and weighted logics on infinite words. ABSTRACT (with G. Rahonis), Izvestiya VUZ. Matematika 54 (2010), 26-45.

64. Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices. (with H. Vogler),
in: 14th Int. Conf. on Developments in Language Theory (DLT), Lecture Notes in Computer Science vol. 6224, Springer, 2010, pp. 160-172.

65. Regular expressions on average and in the long run. (with I. Meinecke), in: 15th International Conference on Implementation and Application of Automata (CIAA 2010),
Lecture Notes in Computer Science vol.6482, Springer, 2011, pp. 211-221.

66. Describing average- and longtime-behavior by weighted MSO logics. (with I. Meinecke), in: Mathematical Foundations of Computer Science (MFCS),
Lecture Notes in Computer Science vol. 6281, Springer, 2010, pp. 537-548.

67. Determinization of weighted finite automata over strong bimonoids. (with M. Ciric, J. Ignjatovic, H. Vogler), Information Sciences 180 (2010), 3497-3520.

68. Weighted logics for unranked tree automata. (with H. Vogler), Theory of Computing Systems 48 (2011), 23-47.

69. A Kleene-Schützenberger theorem for weighted timed automata. ABSTRACT (with K. Quaas), Theoret. Comp. Science 412 (2011), 1140-1153.

70. A cascade decomposition of weighted finite transition systems. ABSTRACT (with I. Meinecke, B. Seselja, A. Tepavcevic),
in: Non-Classical Models of Automata and Applications (NCMA 2011),
Österreichische Computer Gesellschaft, 2011, pp. 137-152.

71. Weighted automata and regular expressions over valuation monoid. (with I. Meinecke), selected papers of CIAA 2010,
Intern. J. of Foundations of Comp. Science, 22 (2011), 1829-1844.

72. Weighted tree automata over valuation monoids and their characterizations by weighted logics. ABSTRACT (with D. Götze, S. Märcker, I. Meinecke),
in: Algebraic Foundations in Computer Science (eds. W. Kuich, G. Rahonis), Lecture Notes in Computer Sciences, vol. 7020, Springer, 2011, pp. 309-346.

73. Coverings and decompositions of semiring-weighted finite transition systems. (with I. Meinecke, B. Seselja, A. Tepavcevic),
in: Fuzzy Semirings with Applications to Automata Theory (by J. Ahsan, J. Mordeson, M. Shabir), chapter 11 (invited), Springer, 2012.

74. Weighted automata and multi-valued logics over arbitrary bounded lattices. (with H. Vogler), Theoret. Comp. Science 418 (2012), 14-36.

75. Weighted nested word automata and logics over strong bimonoids. (with B. Pibaljommee),
in: 17th International Conference on Implementation and Application of Automata (CIAA 2012),
Lecture Notes in Computer Science, vol. 7381, Springer, 2012, pp. 138-148.

76. Weighted automata and weighted MSO logics for average- and longtime-behavior. (with I. Meinecke), Information and Computation, 220-221 (2012), 44-59.

77. Weighted finite automata over hemirings. (with W. Kuich), Theoretical Computer Science 485 (2013), 38-48.

78. The Chomsky-Schützenberger theorem for quantitative context-free languages. (with H. Vogler), in: 17th Int. Conf. on Developments in Language Theory (DLT),
Lecture Notes in Computer Science
, vol. 7907, Springer, 2013, 203-214.

79. Multi-weighted automata and MSO logic. (with V. Perevoshchikov), in: 8th International Computer Science Symposium in Russia
(CSR 2013), Lecture Notes in Computer Science, vol. 7913, Springer,2013, pp. 418-430.

80. Weighted automata. ABSTRACT (with D. Kuske), chapter 4 (invited), in:
Handbook of Automata Theory (J.-E. Pin, ed.), European Mathematical Society, in press.

81. The support of nested weighted automata. (with D. Götze), in: Non-Classical Models of Automata and Applications (NCMA),
Österreichische Computer Gesellschaft, 2013, pp. 101-116.

82. Weighted automata and logics for infinite nested words. (with S. Dück), in: Language and Automata Theory and Applications (LATA 2014),
Lecture Notes in Computer Science, vol. 8370, Springer, 2014, pp. 323-334

83. A Nivat theorem for weighted timed automata and weighted relative distance logic. (with V. Perevoshchikov),
in: 35th Int. Colloq. on Automata, Languages and Programming (ICALP),
Lecture Notes in Computer Science, vol. 8573, Springer, 2014, pp. 171-182.

84. Weighted nested word automata and logics over strong bimonoids. (with B. Pibaljommee),
in: International Journal of Foundations of Computer Science 25 (2014), 641-666.

85. Conway and iteration hemirings, part 1. (with Z. Esik, W. Kuich), Int. J. of Algebra and Computation 24 (2014), 461-482.

86. Conway and iteration hemirings, part 2. (with Z. Esik, W. Kuich), Int. J. of Algebra and Computation 24 (2014), 483-513.

87. The Chomsky-Schützenberger theorem for quantitative context-free languages. (with H. Vogler),
International Journal of Foundations of Computer Science 25 (2014), 955-969. Special issue of DLT 2013.

88. A Nivat theorem for weighted picture automata and weighted MSO logics. (with P. Babari),
in: Language and Automata Theory and Applications (LATA 2015), LNCS vol. 8977, Springer, 2015, pp. 703-715.

89. The supports of weighted unranked tree automata. (with D. Heusel), Fundamenta Informaticae 136 (2015), 37-58.

90. Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics. (with D. Heusel and H.Vogler),
in: Algebraic Informatics (CAI 2015),
Lecture Notes in Computer Science, vol. 9270, Springer, 2015, pp. 90-102

91. Weighted automata and logics on graphs. (with S. Dück), in: 40th Conference on Mathematical Foundations of Computer Science (MFCS),
Lecture Notes in Computer Science, vol. 9234, Springer, 2015, pp. 192-204.

92. A logical characterization of timed pushdown languages. (with V. Perevoshchikov), in: 10th International Computer Science Symposium in Russia (CSR 2015),
Lecture Notes in Computer Science, Springer, vol. 9139, 2015, pp. 189-203.

93. Logics for weighted timed pushdown automata. (with V. Perevoshchikov), 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.

94. Multi-weighted automata and MSO logic. (with V. Perevoshchikov), Theory of Computing Systems, (special issue of CSR 2013), 59 (2016), 231-261.

95. A Kleene theorem for weighted tree automata over tree valuation monoids. (with Z. Fülöp and D. Heusel),
in: Language and Automata Theory and Applications (LATA 2615), Lecture Notes in Computer Science, vol. 9618, Springer, 2016, pp. 452-463.

96. A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem. (with H. Vogler and L. Herrmann),
in: Language and Automata Theory and Applications (LATA 2016),
Lecture Notes in Computer Science, vol. 9618, Springer, 2016, pp. 127-139.

97. Weighted register automata and weighted logic on data words. (with P. Babari and V. Perevoshchikov),
in: International Colloquium on Theoretical Aspects of Computing (ICTAC 2016),
2016, Lecture Notes in Computer Science, vol. 9965, Springer, 2016, pp. 370-384. Best paper award.

98. Weighted linear dynamic logic. (with G. Rahonis), in: International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016),
Electronic Proceedings in Theoretical Computer Science 226, 2016, 149-163.

99. Model checking of linear-time properties in multi-valued systems. (with Yongming Li and Lihui Lei), Information Sciences 377 (2017), 51-74

100. Weighted automata and logics for infinite nested words. (with S. Dück), Information and Computation 253 (2017), 448-466, Special Issue of LATA 2014.

101. A Nivat theorem for weighted picture automata and weighted MSO logics. (with P. Babari), Journal of Computer and System Sciences, special issue of LATA 2015, to appear.

102. Weighted operator precedence languages. (with S. Dück, D. Mandrioli, and M. Pradella), in: Mathematical Foundations of Computer Science (MFCS 2017),
Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, vol. 83, 2017, pp. 31:1--31:15.

103. The triple-pair construction for weighted omega-pushdown automata. (with Z. Esik and W. Kuich),
in: 15th International Conference on Automata and Formal Languages (AFL 2017),
Electronic Proceedings in Theoretical Computer Science, vol. 252, 2017, pp. 101-113.

104. A Nivat theorem for quantitative automata on unranked trees. (with D. Götze),
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.

105. A Kleene theorem for weighted \omega-pushdown automata. (with W. Kuich), Acta Cybernetica 23 (2017),
special issue im memory of Zoltan Esik, pp. 43-59, invited paper.

106. MK-fuzzy automata and MSO logics. (with T. Kutsia, G. Rahonis, W. Schreiner),
in: 8th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2017),
Electronic Proceedings in Theoretical Computer Science 256 (2017), pp. 106-120.

107. Weighted ω-restricted one counter automata. (with W. Kuich), Logical Methods in Computer Science 14 (2018), pp. 1-14.

108. Weighted automata with storage. (with L. Herrmann and H. Vogler), Information and Computation, 2018, to appear. Special issue of LATA 2016.

109. Weighted register automata and weighted logic on data words. (with P. Babari, V. Perevoshchikov), Theoretical Computer Science 744 (2018), pp. 3-21.

110. Nivat's Theorem for Turing machines based on unsharp quantum logic. (with Xiaoya Cheng, E. Paul, Yun Shang), submitted.

111. A Kleene theorem for weighted tree automata over tree valuation monoids. (with D. Götze, Z. Fülöp), Information and Computation, 2018, to appear.
Special issue of LATA 2016.

112. A Feferman-Vaught decomposition theorem for weighted MSO logic. (with E. Paul), in: Mathematical Foundations of Computer Science (MFCS 2018),
LIPIcs, vol. 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, pp. 76:1-76:15.

113. Weighted simple reset pushdown automata. (with S. Dziadek, W. Kuich), Theoret. Comp. Science, to appear.

114. McCarthy-Kleene fuzzy automata and MSO logics. (with T. Kutsia, G. Rahonis, W. Schreiner),
Information and Computation, 2018, to appear. Special issue of GandALF 2017.

115. Logic for omega-pushdown automata. (with S. Dziadek, W. Kuich), submitted.

116. Weighted operator precedence languages. (with S. Dück, D. Mandrioli, and M. Pradella), submitted.

117. The triple-pair construction for weighted omega-pushdown automata. (with Z. Esik, W. Kuich), submitted.

Applications of ordered structures

1. Ordinal scales in the theory of measurement. ABSTRACT J. Math. Psychol. 31 (1987), 60 - 82.

2. Classification and transformation of ordinal scales in the theory of measurement. ABSTRACT in: Progress in Mathematical Psychology I (E. Roskam, R. Suck, eds.),
North Holland, Amsterdam, 1987, pp. 47 - 55.

3. Uniqueness of semicontinuous ordinal utility functions. ABSTRACT J. of Economics, suppl. 8(1999), 23 - 38.

4. Universal homogeneous causal sets. ABSTRACT Journal of Mathematical Physics 46 (2005), 122503 1-10.