Dietrich Kuske

Nicole Schweikardt

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids.

[BibT_eX]

[DOI]

Olena Prianychnykova

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

On Presburger Arithmetic Extended with Modulo Counting Quantifiers.

[BibT_eX]

[DOI]

Peter Habermehl

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

Isomorphisms of scattered automatic linear orders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

The Monoid of Queue Actions.

[BibT_eX]

[DOI]

Martin Huschenbett

Georg Zetzsche

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

On the automaticity of singular Artin monoids of finite type.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

The isomorphism problem for ω-automatic trees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2013

Logical Aspects of the Lexicographic Order on 1-Counter Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree.

[BibT_eX]

[DOI]

Lucas Heimberg

Nicole Schweikardt

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

An optimal construction of Hanf sentences.

[BibT_eX]

[DOI]

Benedikt Bollig

J. Appl. Log., 2012

2011

Automatic structures of bounded degree revisited.

[BibT_eX]

[DOI]

J. Symb. Log., 2011

Construction of tree automata from regular expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Size and Computation of Injective Tree Automatic Presentations.

[BibT_eX]

[DOI]

Thomas Weidner

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Singular Artin Monoids of Finite Coxeter Type Are Automatic.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Where Automatic Structures Benefit from Weighted Automata.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Foundations in Computer Science, 2011

2010

Some natural decision problems in automatic graphs.

[BibT_eX]

[DOI]

J. Symb. Log., 2010

Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Propositional Dynamic Logic for Message-Passing Systems

[BibT_eX]

[DOI]

Benedikt Bollig

Log. Methods Comput. Sci., 2010

The Isomorphism Problem for omega-Automatic Trees

[BibT_eX]

[DOI]

CoRR, 2010

Is Ramsey's Theorem omega-automatic?.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

The Isomorphism Problem on Classes of Automatic Structures.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

The Isomorphism Problem for <i>omega</i>-Automatic Trees.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Weighted and Unweighted Trace Automata.

[BibT_eX]

[DOI]

Acta Cybern., 2009

Theories of Automatic Structures and Their Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

(Un)countable and (Non)effective Versions of Ramsey's Theorem.

[BibT_eX]

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

2008

Schützenberger's theorem on formal power series follows from Kleene's theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

First-order and counting theories of omega-automatic structures.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

Muller message-passing automata and logics.

[BibT_eX]

[DOI]

Benedikt Bollig

Inf. Comput., 2008

Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Hamiltonicity of automatic graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Euler paths and ends in automatic and recursive graphs.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

Weighted asynchronous cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On Communicating Automata with Bounded Channels.

[BibT_eX]

[DOI]

Blaise Genest

Anca Muscholl

Fundam. Informaticae, 2007

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Almost Every Domain is Universal.

[BibT_eX]

[DOI]

Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

2006

Skew and infinitary formal power series.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Theories of orders on the set of words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Logical Aspects of Cayley-graphs: the Monoid Case.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

A Kleene theorem and model checking algorithms for existentially bounded communicating automata.

[BibT_eX]

[DOI]

Blaise Genest

Anca Muscholl

Inf. Comput., 2006

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

First-Order and Counting Theories of <i>omega</i>-Automatic Structures.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Logical aspects of Cayley-graphs: the group case.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

Snapshot Verification.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

2004

Branching automata with costs - a way of reflecting parallelism in costs star.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems.

[BibT_eX]

[DOI]

Peter Weigel

Proceedings of the Developments in Language Theory, 2004

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.

[BibT_eX]

[DOI]

Blaise Genest

Anca Muscholl

Proceedings of the Developments in Language Theory, 2004

2003

Towards a language theory for infinite N-free pomsets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The topology of Mazurkiewicz traces.

[BibT_eX]

[DOI]

Ralph Kummetz

Theor. Comput. Sci., 2003

On random relational structures.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

Regular sets of infinite message sequence charts.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Branching Automata with Costs - A Way of Reflecting Parallelism in Costs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2003

Decidable Theories of Cayley-Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Is Cantor's Theorem Automatic?

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2003

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2003, 2003

2002

Pomsets for Local Trace Languages.

[BibT_eX]

[DOI]

Rémi Morin

J. Autom. Lang. Comb., 2002

A Further Step towards a Theory of Regular MSC Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

On the Theory of One-Step Rewriting in Trace Monoids.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Recognizable languages in divisibility monoids.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2001

A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Divisibility Monoids: Presentation, Word Problem, and Rational Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

Contributions to a trace theory beyond Mazurkiewicz traces.

[BibT_eX]

[DOI]

, 2000

Asynchronous cellular automata for pomsets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus.

[BibT_eX]

[DOI]

Steffen Hölldobler

Proceedings of the Logic for Programming and Automated Reasoning, 2000

Infinite Series-Parallel Posets: Logic and Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets.

[BibT_eX]

[DOI]

Rémi Morin

Proceedings of the CONCUR 2000, 2000

Emptiness Is Decidable for Asynchronous Cellular Machines.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2000, 2000

1999

Symmetries of the Partial Order of Traces.

[BibT_eX]

[DOI]

Order, 1999

On Homogeneous Semilattices and Their Automorphism Groups.

[BibT_eX]

[DOI]

John Kenneth Truss

Order, 1999

1998

Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1998

Topology for Computations of Concurrent Automata.

[BibT_eX]

[DOI]

R. M. Shortt

Int. J. Algebra Comput., 1998

Asynchronous Cellular Automata and Asynchronous Automata for Pomsets.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997

Representation of Computations in Concurrent Automata by Dependence Orders.

[BibT_eX]

[DOI]

Felipe Bracho

Theor. Comput. Sci., 1997

On Existentially First-Order Definable Languages and their Relation to NP

[BibT_eX]

[DOI]

Bernd Borchert

Frank Stephan

Electron. Colloquium Comput. Complex., 1997

1995

Dependence Orders for Computations of Concurrent Automata.

[BibT_eX]

[DOI]

Felipe Bracho

Proceedings of the STACS 95, 1995

Trace Languages Definable with Modular Quantifiers.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

Languages and Logical Definability in Concurrency Monoids.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994

Nondeterministic Automata with Concurrency Relations and Domains.

[BibT_eX]

[DOI]

Proceedings of the Trees in Algebra and Programming, 1994

1993

Modelle nebenläufiger Prozesse - Monoide, Residuensysteme und Automaten.

[BibT_eX]

[DOI]