Manfred Droste
Books

Monographs

Algebra

Theoretical computer science

Applications of ordered structures
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,
SpringerVerlag, 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),
vol. 800, 2019.

Conference on Algebraic Informatics (CAI 2019), Proceedings,
(ed. with M. Ciric, J.E. Pin), Lecture Notes in Computer Science, vol. 11545, Springer, 2019.

Special issue of Information and Computation on "Weighted Automata: Theory and Applications", (ed. with A. Maletti, H. Vogler), in print.

Fields of Logic and Computation III, Essays Dedicated to Yuri Gurevich
on the Occasion of His 80th Birthday (ed. with A. Blass, P. Cegielski, N. Dershowitz, B. Finkbeiner), Lecture Notes in Computer Science, vol. 12180, Springer, 2020.

Special issue of Information and Computation. (ed. with M. Ciric, J.E. Pin), Selected papers from "Conference on Algebraic Informatics (CAI 2019)", in preparation.

Special issue of Information and Computation on "Weighted Automata: Theory and Applications", (ed. with P. Gastin, B. Monmege), in preparation.
↑
Monograph

Structure of partially ordered sets with transitive automorphism groups.
ABSTRACT
Memoirs Amer. Math. Soc. 334 (1985); reprint and update, in preparation
Algebra
 On a theorem of Baer, Schreier and Ulam for permutations (with R. Göbel).
J. Algebra 58 (1979), 282  290.

Über khomogene unendliche Permutationsgruppen. Archiv Math. 34 (1980), 494  495.
 Products of conjugate permutations.
ABSTRACT
(with R. Göbel), Pacific J. Math. 94 (1981), 47  60.
 Wechselwirkung der algebraischen Struktur transitiver
Automorphismengruppen mit der Geometrie ihres
Operationsbereiches.
Dissertation, Universität GHS Essen, 1982.
 Products of conjugacy classes of the infinite symmetric group.
ABSTRACT
Discrete Math. 47 (1983), 35  48.
 On an extendability problem for measures. manuscripta math. 48
(1984), 251  254.
 Cubes of conjugacy classes covering the infinite symmetric group.
ABSTRACT
Trans. Amer. Math. Soc. 288 (1985), 381  393.
 Classes of universal words for the infinite symmetric group,
Algebra Universalis 20 (1985), 205  216.
 Normal subgroups of doubly transitive automorphism groups of chains.
ABSTRACT
(with R.N. Ball), Trans. Amer. Math. Soc. 290 (1985), 647  664.
 A construction of all normal subgroup lattices of 2transitive
automorphism groups of linearly ordered sets.
ABSTRACT
(with S. Shelah), Israel J. Math. 51 (1985), 223  261.
 The normal subgroup lattice of 2transitive automorphism groups of linearly
ordered sets.
ABSTRACT
Order 2 (1985), 291  319.
 On the universality of words for the alternating groups.
ABSTRACT
Proc. Amer. Math. Soc. 96 (1986), 18  22.
 Complete embeddings of linear orderings and embeddings of latticeordered
groups.
ABSTRACT
Israel J. Math. 56 (1986), 315  334.
 Partially ordered sets with transitive automorphism groups.
ABSTRACT
Proc. London Math. Soc. 54 (1987), 514  543.
 On the universality of systems of words in permutation groups.
ABSTRACT
(with S. Shelah), Pacific J. Math. 127 (1987), 321  328.
 Completeness properties of certain normal subgroup lattices.
ABSTRACT
European J. Combinatorics 8 (1987), 129  137
 Squares of conjugacy classes in the infinite symmetric groups.
ABSTRACT
Trans. Amer. Math. Soc. 303 (1987), 503  515.
 Symmetrieverhalten von geordneten Strukturen und Blackwellschen
Meßräumen,
Schrift zur Habilitation, Universität GHS Essen, 1988.
 Normal subgroups and elementary theories of latticeordered groups.
ABSTRACT Order 5 (1988), 261  273.
 Superrigid families of strongly Blackwell spaces.
ABSTRACT
Proc. Amer. Math. Soc. 103 (1988), 803  808.
 The existence of rigid measurable spaces.
ABSTRACT
Topology and its Applications 31 (1989), 187  195.
 Khomogeneous relations and tournaments,
Quarterly J. Math. Oxford (2) 40 (1989), 1  11.

Automorphism groups of infinite semilinear orders (I).
ABSTRACT
(with W.C. Holland, D. Macpherson),
Proc. London Math. Soc. 58 (1989), 454  478.
 Automorphism groups of infinite semilinear orders (II).
ABSTRACT
(with W.C. Holland, D. Macpherson),
Proc. London Math. Soc. 58 (1989), 479  494.
 Embeddings into simple latticeordered groups with different first order theories.
ABSTRACT
(with M. Giraudet), Forum Mathematicum 1 (1989), 315  321.

The root system of prime subgroups of free latticeordered groups (without G.C.H.).
ABSTRACT
(with S.H. McCleary), Order 6 (1989), 305  309.
 On khomogeneous posets and graphs.
ABSTRACT
(with D. Macpherson), J. Combinatorial Theory Ser. A 56 (1991), 1  15.
 Automorphism groups of homogeneous semilinear orders:
Normal subgroups and commutators. (with W.C. Holland, D. Macpherson),
Canadian J. Math. 43 (1991), 721  737.
 Commutators in groups of orderpreserving permutations.
(with R. Shortt), Glasgow Math. J. 33 (1991), 55  59.
 Subgroups of small index in ordered permutation groups.
(with J.K. Truss), Quart. J. Math. Oxford (2) 42 (1991), 31  47.
 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.
 Representations of free latticeordered groups.
ABSTRACT
Order 10 (1993), 375  381.
 Sethomogeneous graphs.
ABSTRACT
(with M. Giraudet, D. Macpherson, N. Sauer), J. Combinatorial Theory Ser. B, 62
(1994), 63  95.
 Periodic ordered permutation groups and cyclic orderings
(with M. Giraudet, D. Macpherson), J. Combinatorial Theory Ser. B, 63 (1995), 310  321.
 McLain groups over arbitrary rings and orderings
(with R. Göbel), Math. Proc. Camb. Philos. Soc. 117 (1995), 439  467.
 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.
 The automorphism groups of Hahngroups
(with R. Göbel), in: "Ordered Algebraic Structures" (W.C. Holland, J. Martinez, ed.),
Kluwer Academic Publishers, 1997, pp. 183  215.
 Sethomogeneous graphs and embeddings of total orders.
ABSTRACT
(with M. Giraudet, D. Macpherson), Order 14 (1997), 9  20.
 Simple automorphism groups of cyclefree partial orders.
ABSTRACT
(with J.K. Truss, R. Warren),
Forum Mathematicum 11 (1999), 279  294.
 On homogeneous semilattices and their automorphism groups.
ABSTRACT
(with D. Kuske, J.K. Truss), Order 16 (1999), 31  56.
 The automorphism group of the universal distributive lattice.
ABSTRACT
(with D. Macpherson), Algebra Universalis 43 (2000), 295  306.
 Complementary closed rational clones are not always Krasner clones.
ABSTRACT
(with D. Kuske, R. McKenzie, R. Pöschel),
Algebra Universalis 45 (2001), 155  160.
 Rigid chains admitting many embeddings.
ABSTRACT
(with J.K. Truss), Proc. Amer. Math. Soc. 129 (2001), 1601  1608.
 All groups are outer automorphism groups of simple groups.
ABSTRACT
(with M. Giraudet, R. Göbel), Journal London Math. Soc. 64 (2001), 565  575.
 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.
 Outer automorphism groups of ordered permutation groups.
ABSTRACT
(with S. Shelah), Forum Mathematicum 14 (2002), 605  621.
 Uncountable homogeneous partial orders,
(with D. Macpherson, A Mekler)
Mathematical Logic Quarterly 48 (2002), 525  532.
 On random relational structures.
ABSTRACT
(with D. Kuske),
Journal of Combinatorial Theory  Series A, 102 (2003), 241  254.
 Generating automorphism groups of chains.
ABSTRACT
(with W. Ch. Holland), Forum Mathematicum 17 (2005), 699710.
 Uncountable cofinalities of permutation groups.
ABSTRACT
(with R. Göbel),
J. London Math. Soc. (2) 71 (2005), 335344.
 On representing words in the automorphism group of the random graph.
(with J. Truss),
Journal of Group Theory 9 (2006) 815836.
 Normal Subgroups of B_{u}Aut(Ω). ABSTRACT (with W.Ch. Holland), Applied Categorical Structures 15 (2007), 153162.
 Absolute graphs with prescribed endomorphism monoids.
ABSTRACT
(with R. Göbel, S. Pokutta), Semigroup Forum 76 (2008), 256267.
 Construction of some uncountable 2arctransitive bipartite graphs.
ABSTRACT
(with R.Gray, J.K.Truss), Order 25 (2008), 349357.
 On full groups of measurepreserving and ergodic transformations with uncountable cofinalities.
ABSTRACT
(with C.Holland, G.Ulbrich),
Bulletin London Math. Soc. 40 (2008), 463472.
 Stabilizers of direct composition series.
ABSTRACT
(with R. Göbel), Algebra Universalis 62 (2009), 209237.
 Uncountable cofinalities of automorphism groups of linear and partial orders.
ABSTRACT
(with J.K. Truss), Algebra Universalis 62 (2009), 7590.
 On extension of coverings.
ABSTRACT
(with I. Rivin), Bull. London Math. Soc. 42 (2010), 10441054.
 Automorphism groups of totally ordered sets: a retrospective survey.
ABSTRACT
(with V. Bludov, A.M.W. Glass), Mathematica Slovaca 61 (2011), 373388.
 Countable random pgroups with prescribed Ulminvariants.
(with R. Göbel), Proc. Amer. Math. Soc. 139 (2011), 32033216.
 The uncountable cofinality of the automorphism group
of the countable universal distributive lattice
(with J.K. Truss), Demonstratio Mathematica 44 (2011), 473479.
 The normal subsemigroups of the monoid of injective maps.
ABSTRACT
(with R. Göbel), Semigroup Forum 87 (2013), 298312.
 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. 269275.
↑
Theoretical computer science
 Event structures and domains.
ABSTRACT
Theoret. Comp. Sci.68 (1989), 37  47.
 Recursive domain equations for concrete data structures.
ABSTRACT
Information and Computation 82 (1989), 65  80.
 Nondeterministic information systems and their domains.
ABSTRACT
(with R. Göbel), Theoret. Comp. Sci. 75 (1990), 289  309.
 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.
 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.
 Concurrency, automata and domains.
ABSTRACT,
in: Automata,
Languages and Programming (17th ICALP, Warwick),
Lecture Notes in Comp. Science 443, Springer, 1990, pp. 195 208.
 Universal homogeneous event structures and domains.
ABSTRACT
Information and Computation 94 (1991), 48  61.
 Universal information systems.
ABSTRACT
(with R. Göbel),
Intern. J. of Foundations of Comp. Science 1 (1991), 413  424.
 Finite axiomatizations for universal domains.
ABSTRACT
J. of Logic and Computation 2 (1992), 119  131.
 Concurrent automata and domains.
ABSTRACT
Intern. J. of Foundations of Comp. Science 3 (1992), 389  418.
 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.
 On stable domains, Theoret. Comp. Science 111 (1993), 89  101.
 Universal domains and the amalgamation property.
ABSTRACT
(with R. Göbel), Mathem. Structures in Comp. Science 3 (1993), 137  159.
 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.
 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.
 Labelled domains and automata with concurrency.
ABSTRACT
(with F. Bracho), Theoret. Comp. Science 135 (1994), 289  318.
 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.
 Recognizable languages in concurrency monoids.
ABSTRACT
Theoret. Comp. Science 150 (1995), 77  108.
 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.
 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.
 Aperiodic languages in concurrency monoids.
ABSTRACT
Information and Computation 126 (1996), 105  113.
 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.
 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.
 Representation of computations in concurrent automata by dependence orders.
ABSTRACT
(with F. Bracho, D. Kuske),
Theoret. Comp. Science 174 (1997), 67  96.
 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.
 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.
 Temporal logics for computations in concurrency monoids. (with D. Kuske), Preprint.
 The KleeneSchützenberger theorem for formal power series in partially commuting variables.
ABSTRACT
(with P. Gastin),
Information and Computation 153 (1999), 47  80.
 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.
 Asynchronous cellular automata for pomsets.
ABSTRACT
(with P. Gastin, D. Kuske), Theoret. Comp. Science 247 (2000), 1  38 (fundamental
study).
 On aperiodic and starfree 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.
 Recognizable languages in divisibility monoids.
ABSTRACT
(with D. Kuske), Mathem. Structures in Comp. Science 11 (2001), 743  770.
 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.
 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.
 Universal homogeneous graphlike structures and domains.
ABSTRACT
(with P. Boldi, F. Cardone), Mathem. Structures in Comp. Science,
12 (2002), 91  109.
 From Petri nets to automata with concurrency.
ABSTRACT
(with R.M. Shortt), Applied Categorical Structures 10 (2002), 173  191.
 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.
 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.
 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.
 On transformations of formal power series.
(with G.Q. Zhang), Information and Computation, 184 (2003), 369  383.
 A Kleene theorem for weighted tree automata.
ABSTRACT
(with C. Pech, H. Vogler), Theory of Computing Systems, 38 (2005), 138.
 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. 513525.
 Observations on the smoothness properties of real functions computed by weighted finite automata.
(with J. Kari, P. Steinby),
Fundamenta Informaticae, 73 (2006), 99106.
 Skew and infinitary formal power series
ABSTRACT (with D. Kuske), Theoret. Comp. Science 366 (2006), 199227.
 Weighted tree automata and weighted logics
ABSTRACT
(with H. Vogler), Theoret. Comp.Science 366 (2006), 228247.
 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. 4958.
 Weighted automata and weighted logics
ABSTRACT
(with P. Gastin), Theoretical Computer Science (special issue of ICALP '05),
380 (2007), 6986
 On weighted Büchi automata with ordercomplete weights
ABSTRACT (with U. Püschmann), Intern. J. of Algebra and Computation,
17 (2007), 235260.
 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, 103119 (2007).
 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. 179193.
 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. 7384.
 On aperiodic and starfree formal power series in partially commuting variables.
ABSTRACT(with P. Gastin), Theory of Computing Systems 42 (2008), 608631.
 Multivalued MSO logics over words and trees.
ABSTRACT(with W. Kuich, G. Rahonis), Fundamenta Informaticae 84 (2008), 305327.
 Random event structures. ABSTRACT(with G.Q. Zhang), International Journal of Software and Informatics 2 (2008), 7788.
 A KleeneSchü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. 142156.
 Weighted automata with discounting. (with J. Sakarovitch, H. Vogler), Information Processing Letters 108 (2008), 2328.
 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), 285297p;
 Weighted automata and weighted logics with discounting.
(with G. Rahonis), Theoretical Computer Science 410 (2009), 34813494.
 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, SpringerVerlag, 2009.

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, SpringerVerlag, 2009.

Weighted finite automata over strong bimonoids.
ABSTRACT(with T. Stüber, H. Vogler), Information Sciences 180 (2010), 156166.
 Bifinite Chu spaces. (with G.Q. Zhang), Logical Methods in Computer Science 6 (2010), 120.
 Weighted automata and weighted logics on infinite words.
ABSTRACT (with G. Rahonis), Izvestiya VUZ. Matematika 54 (2010), 2645.
 Kleene and Büchi theorems for weighted automata and multivalued 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. 160172.
 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. 211221.
 Describing average and longtimebehavior by weighted MSO logics.
(with I. Meinecke), in: Mathematical Foundations of Computer Science (MFCS),
Lecture Notes in Computer Science vol. 6281, Springer, 2010, pp. 537548.
 Determinization of weighted finite automata over strong bimonoids.
(with M. Ciric, J. Ignjatovic, H. Vogler), Information Sciences 180 (2010), 34973520.
 Weighted logics for unranked tree automata. (with H. Vogler), Theory of Computing Systems 48 (2011), 2347.

A KleeneSchützenberger theorem for weighted timed automata.
ABSTRACT
(with K. Quaas), Theoret. Comp. Science 412 (2011), 11401153.
 A cascade decomposition of weighted finite transition systems.
ABSTRACT
(with I. Meinecke, B. Seselja, A. Tepavcevic),
in: NonClassical Models of Automata and Applications (NCMA 2011),
Österreichische Computer Gesellschaft, 2011, pp. 137152.
 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), 18291844.
 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. 309346.
 Coverings and decompositions of semiringweighted 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.
 Weighted automata and multivalued logics over arbitrary bounded lattices.
(with H. Vogler), Theoret. Comp. Science 418 (2012), 1436.
 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. 138148.
 Weighted automata and weighted MSO logics for average and longtimebehavior. (with I. Meinecke), Information and Computation, 220221 (2012), 4459.
 Weighted finite automata over hemirings.
(with W. Kuich), Theoretical Computer Science 485 (2013), 3848.
 The ChomskySchützenberger theorem for quantitative contextfree languages. (with H. Vogler),
in: 17th Int. Conf. on Developments in Language Theory (DLT),
Lecture Notes in Computer Science, vol. 7907, Springer, 2013,
203214.
 Multiweighted 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. 418430.
 The support of nested weighted automata. (with D. Götze), in: NonClassical Models of Automata and Applications (NCMA),
Österreichische Computer Gesellschaft, 2013, pp. 101116.
 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. 323334

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

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

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

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

The ChomskySchützenberger theorem for quantitative contextfree languages. (with H. Vogler),
International Journal of Foundations of Computer Science 25 (2014), 955969. Special issue of DLT 2013.

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

The supports of weighted unranked tree automata. (with D. Heusel), Fundamenta Informaticae 136 (2015), 3758.

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

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

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

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

Multiweighted automata and MSO logic. (with V. Perevoshchikov), Theory of Computing Systems, (special issue of CSR 2013), 59 (2016), 231261.

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

A weighted MSO logic with storage behaviour and its BüchiElgotTrakhtenbrot 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. 127139.

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. 370384. Best paper award.

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, 149163.
 Model checking of lineartime properties in multivalued systems.
(with Yongming Li and Lihui Lei), Information Sciences 377 (2017), 5174

Weighted automata and logics for infinite nested words.
(with S. Dück), Information and Computation 253 (2017), 448466, Special Issue of LATA 2014.
 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  LeibnizZentrum für Informatik, vol. 83, 2017, pp. 31:131:15.
 The triplepair construction for weighted ω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. 101113.
 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. 2235.
 A Kleene theorem for weighted ωpushdown automata.
(with W. Kuich), Acta Cybernetica 23 (2017),
special issue im memory of Zoltan Esik, pp. 4359, invited paper.
 MKfuzzy 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. 106120.
 Weighted ωrestricted one counter automata.
(with W. Kuich), Logical Methods in Computer Science 14 (2018), pp. 114.
 Weighted register automata and weighted logic on data words (with P. Babari, V. Perevoshchikov), Theoretical Computer Science 744 (2018), pp. 321.

A FefermanVaught decomposition theorem for weighted MSO logic
(with E. Paul), in: Mathematical Foundations of Computer Science (MFCS 2018),
LIPIcs, vol. 117, Schloss Dagstuhl  LeibnizZentrum für Informatik, 2018, pp. 76:176:15.
 A Nivat theorem for weighted picture automata and weighted MSO logics
(with P. Babari), Journal of Computer and System Sciences 104 (2019), 4157. Special issue of LATA 2015.

Weighted simple reset pushdown automata (with S. Dziadek, W. Kuich), Theoretical Computer Science 777 (2019), pp. 252259.
 Aperiodic weighted automata and weighted firstorder logic
(with P. Gastin), in: Mathematical Foundations of Computer Science (MFCS 2019), LIPIcs,
vol. 138, Schloss Dagstuhl  LeibnizZentrum für Informatik, 2019,
pp. 76:176:15.

Greibach normal form for ωalgebraic systems and weighted simple ωpushdown automata
(with M. Droste, S. Dziadek, W. Kuich), in:
Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2019), LIPIcs, vol. 150, Schloss Dagstuhl  LeibnizZentrum für Informatik, 2019,
pp. 38:138:14.

Weighted automata with storage.
(with L. Herrmann and H. Vogler), Information and Computation 269 (2019), 104447 (29 pages). Special issue of LATA 2016.

A Kleene theorem for weighted tree automata over tree valuation monoids
(with D. Götze, Z. Fülöp), Information and Computation 269 (2019), 104445 (17 pages). Special issue of LATA 2016.

McCarthyKleene fuzzy automata and MSO logics (with T. Kutsia, G. Rahonis, W. Schreiner),
Information and Computation 272 (2020), 104499 (23 pages). Special issue of GandALF 2017.

Nivattheorem and logic for weighted pushdown automata on infinite words (with S. Dziadek, W. Kuich), in: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), LIPIcs, vol. 182, Schloss Dagstuhl  LeibnizZentrum für Informatik, pp. 44:144:14, 2020.

Crispdeterminizability of weighted tree automata over additively locally finite pastfinite monotonic strong bimonoids is decidable
(with Z. Fülöp, D. Kószó, H. Vogler), in: Descriptional Complexity of Formal Systems (DCFS 2020), LNCS, vol. 12442 Springer, 2020, pp. 3951.
 Nivat's Theorem for Turing machines based on unsharp quantum logic (with Xiaoya Cheng, E. Paul, Yun Shang), submitted.

Logic for ωpushdown automata (with S. Dziadek, W. Kuich),
Information and Computation, special issue on "Weighted Automata",
to appear.
 Weighted operator precedence languages
(with S. Dück, D. Mandrioli, and M. Pradella), Information and Computation,
special issue on "Weighted Automata",
to appear.
 The triplepair construction for weighted ωpushdown automata
(with Z. Esik, W. Kuich), submitted.
 Weighted automata. ABSTRACT (with D. Kuske), chapter 4 (invited), in:
Handbook of Automata Theory (J.E. Pin, ed.), European Mathematical Society, in press.
↑
Applications of ordered structures
 Ordinal scales in the theory of measurement.
ABSTRACT
J. Math. Psychol. 31 (1987), 60  82.
 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.
 Uniqueness of semicontinuous ordinal utility functions.
ABSTRACT J. of Economics, suppl. 8(1999), 23  38.

Universal homogeneous causal sets.
ABSTRACT Journal of Mathematical Physics 46 (2005), 122503 110.
↑
←