default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 59
Volume 59, Number 1, February 2022
- Tamás Tóth
, István Majzik:
Configurable verification of timed automata with discrete variables. 1-35 - James Baxter, Pedro Ribeiro, Ana Cavalcanti:
Sound reasoning in tock-CSP. 125-162 - Mauricio Cano, Hugo A. López, Jorge A. Pérez, Camilo Rueda:
Session-based concurrency, declaratively. 1-87 - Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite automata with undirected state graphs. 163-181
Volume 59, Number 2-3, June 2022
- Mert Ergurtuna, Beyazit Yalcinkaya, Ebru Aydin Gol:
An automated system repair framework with signal temporal logic. 183-209 - Andrea Marin, Carla Piazza, Sabina Rossi:
Proportional lumpability and proportional bisimilarity. 211-244 - Amr Elmasry, Jyrki Katajainen:
Regular numeral systems for data structures. 245-281 - James Baxter, Pedro Ribeiro, Ana Cavalcanti:
Correction to: Sound reasoning in tock-CSP. 283
Volume 59, Number 4, August 2022
- Henning Fernau, Markus Holzer, Petra Wolf:
Preface to Klaus-Jörn Lange Festschrift. 285-287 - Eric Allender, Archit Chauhan, Samir Datta:
Depth-first search in directed planar graphs, revisited. 289-319 - Michaël Cadilhac, Charles Paperman:
The regular languages of wire linear AC0. 321-336 - Jürgen Dassow, Ismaël Jecker:
Operational complexity and pumping lemmas. 337-355 - Volker Diekert, Henning Fernau, Petra Wolf:
Properties of graphs specified by a regular language. 357-385 - Thomas Erlebach, Jakob T. Spooner:
Exploration of k-edge-deficient temporal graphs. 387-407 - Kaoru Fujioka, Fumiya Okubo, Takashi Yokomori:
ℒ-reduction computation revisited. 409-426 - Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith:
Reoptimization of parameterized problems. 427-450 - Sanjay Jain, Birzhan Moldagaliyev, Frank Stephan, Tien Dat Tran:
Lamplighter groups and automata. 451-478 - Hanan Shabana, Mikhail V. Volkov:
Careful synchronization of partial deterministic finite automata. 479-504 - Petra Wolf:
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances. 505-519
Volume 59, Number 5, October 2022
- Ayleen Schinko, Walter Vogler, Johannes Gareis, N. Tri Nguyen, Gerald Lüttgen:
Interface Automata for Shared Memory. 521-556 - Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy:
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. 557-584 - Jan Kretínský, Tobias Meggendorfer, Clara Waldmann, Maximilian Weininger:
Index appearance record with preorders. 585-618 - Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok:
Improved complement for two-way alternating automata. 619-669 - Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Correction to: Reactive synthesis without regret. 671
Volume 59, Number 6, December 2022
- Marcin Michalak:
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction. 673-685 - Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's algorithm for generalized binary split trees. 687-708 - Philip Bille, Inge Li Gørtz:
From regular expression matching to parsing. 709-724 - Soumyadip Bandyopadhyay, Dipankar Sarkar, Chittaranjan A. Mandal, Holger Giese:
Translation validation of coloured Petri net models of programs on integers. 725-759
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 2026-06-11 23:10 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:
