Publication | Date of Publication | Type |
---|
On Guidable Index of Tree Automata | 2023-08-08 | Paper |
200 Problems on Languages, Automata, and Computation | 2023-01-30 | Paper |
Automata on infinite trees with counting constraints | 2022-11-02 | Paper |
Daniel Simson Obituary | 2022-10-31 | Paper |
Contribution of Warsaw logicians to computational logic | 2019-06-19 | Paper |
The Ackermann Award 2013 | 2017-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4982350 | 2015-04-09 | Paper |
On the separation question for tree languages | 2015-02-05 | Paper |
Preface | 2013-11-28 | Paper |
The Ackermann Award 2012. | 2012-11-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q2904779 | 2012-08-23 | Paper |
On Topological Completeness of Regular Tree Languages | 2012-07-16 | Paper |
On the Borel Inseparability of Game Tree Languages | 2012-04-24 | Paper |
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal | 2012-01-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3086917 | 2011-03-30 | Paper |
Preface | 2011-01-03 | Paper |
Choice functions and well-orderings over the infinite binary tree | 2010-11-22 | Paper |
The Ackermann Award 2010 | 2010-09-03 | Paper |
On the Borel Complexity of MSO Definable Sets of Branches | 2010-05-25 | Paper |
The Ackermann Award 2007 | 2009-03-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q5445157 | 2008-03-03 | Paper |
On the positional determinacy of edge-labeled games | 2006-03-24 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4738227 | 2004-08-11 | Paper |
A gap property of deterministic tree languages. | 2003-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4411813 | 2003-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q2778825 | 2002-03-21 | Paper |
Rudiments of \(\mu\)-calculus | 2001-03-18 | Paper |
On Distributive Fixed-Point Expressions | 2000-03-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4936126 | 2000-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4266546 | 1999-10-03 | Paper |
Fixed point characterization of infinite behavior of finite-state systems | 1998-06-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4381391 | 1998-04-01 | Paper |
y= 2xVS.y= 3x | 1997-09-28 | Paper |
Games for the \(\mu\)-calculus | 1997-02-27 | Paper |
On the feasibility of checking temporal integrity constraints | 1996-06-10 | Paper |
Automata on infinite trees with counting constraints | 1996-04-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4273664 | 1994-08-28 | Paper |
THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON | 1993-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4035259 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3989948 | 1992-06-28 | Paper |
A geometrical view of the determinization and minimization of finite-state automata | 1991-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5753528 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3033318 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3730012 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4723706 | 1985-01-01 | Paper |
Fixed-point characterization of context-free ∞-languages | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3326821 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3949985 | 1982-01-01 | Paper |