default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 244
Volume 244, October 2015
- Eva Maia
, Nelma Moreira, Rogério Reis:
Incomplete operational transition complexity of regular languages. 1-22 - Antti Siirtola, Juha Kortelainen:
Multi-parameterised compositional verification of safety properties. 23-48 - Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Jan J. M. M. Rutten:
The dual equivalence of equations and coequations for automata. 49-75 - Sami Zhioua:
Analyzing anonymity attacks through noisy channels. 76-112 - Yoram Bachrach, Ely Porat:
Fingerprints for highly similar streams. 113-121 - Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales-Ponce, Eduardo Pacheco:
Position discovery for a system of bouncing robots. 122-133 - Andrea Turrini, Holger Hermanns:
Polynomial time decision algorithms for probabilistic automata. 134-171 - Michael Benedikt, Gabriele Puppis, Huy Vu:
The complexity of higher-order queries. 172-202 - Michel Latteux, Yves Roos:
A canonical automaton for one-rule length-preserving string rewrite systems. 203-228 - Lvzhou Li, Yuan Feng:
Quantum Markov chains: Description of hybrid systems, decidability of equivalence, and model checking linear-time properties. 229-244
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-08 09:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
