default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 253
Volumes 253, Part 1, April 2017
- Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate:
Quantitative model-checking of controlled discrete-time Markov processes. 1-35 - Galina Jirásková
, Alexander Okhotin:
On the state complexity of operations on two-way finite automata. 36-63 - Laurent Bienvenu, Ludovic Patey:
Diagonally non-computable functions and fireworks. 64-77 - Ryszard Janicki, Xiang Yin:
Modeling concurrency with interval traces. 78-108 - Yixin Cao:
Unit interval editing is fixed-parameter tractable. 109-126 - Éric Duchêne, Aline Parreau, Michel Rigo:
Deciding game invariance. 127-142 - Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Further remarks on DNA overlap assembly. 143-154 - Toru Fuda, Miho Tonozaki:
Brudno's theorem for Zd (or ) subshifts. 155-162 - Viliam Geffert:
Alternating space is closed under complement and other simulations for sublogarithmic space. 163-178
Volumes 253, Part 2, April 2017
- Adriano Peron, Carla Piazza:
Games, Automata, Logics and Formal Verification (GandALF 2014) - Preface. 179-180 - Bernd Finkbeiner, Ernst-Rüdiger Olderog:
Petri games: Synthesis of distributed systems with causal memory. 181-203 - Ilaria De Crescenzo, Salvatore La Torre, Yaron Velner:
Visibly pushdown modular games, . 204-223 - Jonni Virtema:
Complexity of validity for propositional dependence logics. 224-236 - Peter Faymonville, Martin Zimmermann:
Parametric Linear Dynamic Logic. 237-256 - Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato:
On the path-width of integer linear programming. 257-271 - Daniel Bundala, Joël Ouaknine:
On parametric timed automata and one-counter machines. 272-303 - Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Automata for unordered trees. 304-335 - Christof Löding, Sarah Winter:
Synthesis of deterministic top-down tree transducers from automatic tree relations. 336-354
Volumes 253, Part 3, April 2017
- Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe:
Selected papers of the 8th International Conference on Language and Automata Theory and Applications (LATA 2014). 355-357 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Picture codes and deciphering delay. 358-370 - Fernando Arroyo, Sandra Gómez Canaval, Victor Mitrana, Stefan Popescu:
On the computational power of networks of polarized evolutionary processors. 371-380 - Zuzana Bednárová, Viliam Geffert:
Two double-exponential gaps for automata with a limited pushdown. 381-398 - Eike Best, Raymond Devillers:
Characterisation of the state spaces of marked graph Petri nets. 399-410 - Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the list update problem with advice. 411-423 - Anton Cerný:
Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms. 424-435 - Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
CNF and DNF succinct graph encodings. 436-447 - Manfred Droste, Stefan Dück:
Weighted automata and logics for infinite nested words. 448-466 - Bertram Felgenhauer, René Thiemann:
Reachability, confluence, and termination analysis with state-compatible automata. 467-483 - Marius Konitzer, Hans Ulrich Simon:
Regular languages viewed from a graph-theoretic perspective. 484-496 - Vojtech Vorel:
Complexity of a problem concerning reset words for Eulerian binary automata. 497-509
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-10-22 02:19 CEST 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:
