| Publication | Date of Publication | Type |
|---|
Accepting runs in a two-way finite automaton
Information and Computation | 2018-05-30 | Paper |
Information rate of some classes of non-regular languages: an automata-theoretic approach
Information and Computation | 2017-09-28 | Paper |
Lossiness of communication channels modeled by transducers1
Computability | 2017-07-21 | Paper |
Quantifying communication in synchronized languages
Theoretical Computer Science | 2016-11-24 | Paper |
Execution information rate for some classes of automata
Information and Computation | 2015-12-28 | Paper |
Quantifying communication in synchronized languages
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Security of numerical sensors in automata
Implementation and Application of Automata | 2015-09-23 | Paper |
Sampling a two-way finite automaton
Automata, Universality, Computation | 2015-04-14 | Paper |
Sampling automata and programs
Theoretical Computer Science | 2015-04-01 | Paper |
Lossiness of Communication Channels Modeled by Transducers
Language, Life, Limits | 2015-02-25 | Paper |
Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Similarity in languages and programs
Theoretical Computer Science | 2014-01-10 | Paper |
Execution information rate for some classes of automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Typical paths of a graph
Fundamenta Informaticae | 2011-11-22 | Paper |
Information gain of black-box testing
Formal Aspects of Computing | 2011-10-18 | Paper |
Automatic verification of multi-queue discrete timed automata
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Automata and processes on multisets of communicating objects
Natural Computing | 2010-11-30 | Paper |
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing
Natural Computing | 2010-09-16 | Paper |
New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract)
Implementation and Application of Automata | 2010-05-07 | Paper |
Dense counter machines and verification problems.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Automata on Multisets of Communicating Objects
Unconventional Computing | 2008-12-02 | Paper |
ON STATELESS AUTOMATA AND P SYSTEMS
International Journal of Foundations of Computer Science | 2008-12-01 | Paper |
ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
On the decidability of model-checking for P systems
| 2008-06-18 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
Formal Approaches to Software Testing | 2007-05-02 | Paper |
On the computational power of 1-deterministic and sequential \(P\) systems
| 2006-11-21 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Unconventional Computation
Lecture Notes in Computer Science | 2006-07-07 | Paper |
On the solvability of a class of Diophantine equations and applications
Theoretical Computer Science | 2006-03-24 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Formal Approaches to Software Testing
Lecture Notes in Computer Science | 2005-12-02 | Paper |
ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
On composition and lookahead delegation of \(e\)-services modeled by automata
Theoretical Computer Science | 2005-09-22 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
On two-way nondeterministic finite automata with one reversal-bounded counter
Theoretical Computer Science | 2005-02-22 | Paper |
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Theoretical Computer Science | 2005-01-11 | Paper |
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science | 2004-10-27 | Paper |
On two-way FA with monotonic counters and quadratic Diophantine equations
Theoretical Computer Science | 2004-10-27 | Paper |
scientific article; zbMATH DE number 2081100 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080995 (Why is no real title available?)
| 2004-08-04 | Paper |
Past pushdown timed automata and safety verification.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2038746 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1979491 (Why is no real title available?)
| 2003-09-14 | Paper |
Pushdown timed automata: A binary reachability characterization and safety verification.
Theoretical Computer Science | 2003-08-17 | Paper |
Verification in loosely synchronous queue-connected discrete timed automata.
Theoretical Computer Science | 2003-08-17 | Paper |
Generalized discrete timed automata: Decidable approximations for safety verification.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1949647 (Why is no real title available?)
| 2003-07-15 | Paper |
scientific article; zbMATH DE number 1948510 (Why is no real title available?)
| 2003-07-13 | Paper |
Presburger liveness verification of discrete timed automata.
Theoretical Computer Science | 2003-05-25 | Paper |
Eliminating the storage tape in reachability constructions.
Theoretical Computer Science | 2003-05-25 | Paper |
Counter machines and verification problems.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1798172 (Why is no real title available?)
| 2002-11-04 | Paper |
scientific article; zbMATH DE number 1796157 (Why is no real title available?)
| 2002-09-04 | Paper |
scientific article; zbMATH DE number 1759429 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1689043 (Why is no real title available?)
| 2002-01-09 | Paper |
scientific article; zbMATH DE number 1670769 (Why is no real title available?)
| 2001-11-11 | Paper |
