| Publication | Date of Publication | Type |
|---|
| Accepting runs in a two-way finite automaton | 2018-05-30 | Paper |
| Information rate of some classes of non-regular languages: an automata-theoretic approach | 2017-09-28 | Paper |
| Lossiness of communication channels modeled by transducers1 | 2017-07-21 | Paper |
| Quantifying communication in synchronized languages | 2016-11-24 | Paper |
| Execution information rate for some classes of automata | 2015-12-28 | Paper |
| Quantifying Communication in Synchronized Languages | 2015-10-29 | Paper |
| Security of Numerical Sensors in Automata | 2015-09-23 | Paper |
| Sampling a Two-Way Finite Automaton | 2015-04-14 | Paper |
| Sampling automata and programs | 2015-04-01 | Paper |
| Lossiness of Communication Channels Modeled by Transducers | 2015-02-25 | Paper |
| Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach | 2014-10-14 | Paper |
| Similarity in languages and programs | 2014-01-10 | Paper |
| Execution Information Rate for Some Classes of Automata | 2013-03-18 | Paper |
| Typical Paths of a Graph | 2011-11-22 | Paper |
| Information gain of black-box testing | 2011-10-18 | Paper |
| Automatic verification of multi-queue discrete timed automata | 2011-03-18 | Paper |
| Automata and processes on multisets of communicating objects | 2010-11-30 | Paper |
| Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing | 2010-09-16 | Paper |
| New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract) | 2010-05-07 | Paper |
| Dense counter machines and verification problems. | 2010-04-20 | Paper |
| Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing | 2009-02-17 | Paper |
| Automata on Multisets of Communicating Objects | 2008-12-02 | Paper |
| ON STATELESS AUTOMATA AND P SYSTEMS | 2008-12-01 | Paper |
| ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS | 2008-09-25 | Paper |
| On the decidability of model-checking for P systems | 2008-06-18 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach | 2007-05-02 | Paper |
| On the computational power of 1-deterministic and sequential \(P\) systems | 2006-11-21 | Paper |
| Membrane Computing | 2006-11-13 | Paper |
| Unconventional Computation | 2006-07-07 | Paper |
| On the solvability of a class of Diophantine equations and applications | 2006-03-24 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Formal Approaches to Software Testing | 2005-12-02 | Paper |
| ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE | 2005-11-14 | Paper |
| On composition and lookahead delegation of \(e\)-services modeled by automata | 2005-09-22 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS | 2005-08-03 | Paper |
| THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS | 2005-06-22 | Paper |
| On two-way nondeterministic finite automata with one reversal-bounded counter | 2005-02-22 | Paper |
| Linear reachability problems and minimal solutions to linear Diophantine equation systems | 2005-01-11 | Paper |
| Catalytic P systems, semilinear sets, and vector addition systems | 2004-10-27 | Paper |
| On two-way FA with monotonic counters and quadratic Diophantine equations | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474213 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474093 | 2004-08-04 | Paper |
| Past pushdown timed automata and safety verification. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449211 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425946 | 2003-09-14 | Paper |
| Pushdown timed automata: A binary reachability characterization and safety verification. | 2003-08-17 | Paper |
| Verification in loosely synchronous queue-connected discrete timed automata. | 2003-08-17 | Paper |
| Generalized discrete timed automata: Decidable approximations for safety verification. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412570 | 2003-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412126 | 2003-07-13 | Paper |
| Presburger liveness verification of discrete timed automata. | 2003-05-25 | Paper |
| Eliminating the storage tape in reachability constructions. | 2003-05-25 | Paper |
| Counter machines and verification problems. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553242 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551181 | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536378 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762788 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754074 | 2001-11-11 | Paper |
