default search action
Acta Informatica, Volume 58
Volume 58, Number 1-2, April 2021
- Ivan Lanese, Doriana Medic, Claudio Antares Mezzina:
Static versus dynamic reversibility in CCS. 1-34 - Steven Engels, Tony Tan, Jan Van den Bussche:
Subsequence versus substring constraints in sequence pattern languages. 35-56 - Arnab Bhattacharyya, Ashutosh Gupta, Lakshmanan Kuppusamy, Somya Mani, Ankit Shukla, Mandayam K. Srivas, Mukund Thattai:
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system. 57-93 - Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. 95-152
Volume 58, Number 3, June 2021
- Benedek Nagy, Shaghayegh Parchami:
On deterministic sensing $5'\rightarrow 3'$ Watson-Crick finite automata: a full hierarchy in 2detLIN. 153-175 - Johanna Björklund, Loek Cleophas:
Aggregation-based minimization of finite state automata. 177-194 - Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
A deterministic parsing algorithm for ambiguous regular expressions. 195-229 - Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray:
Watson-Crick quantum finite automata. 231-240
Volume 58, Number 4, August 2021
- Henning Fernau, Andreas Malcher, Giovanni Pighizzini:
Preface to Martin Kutrib Festschrift. 241-242 - Ahmad Ostovar, Suna Bensch, Thomas Hellström:
Natural language guided object retrieval in images. 243-261 - Henning Bordihn, György Vaszil:
Reversible parallel communicating finite automata systems. 263-279 - Jürgen Dassow:
Operational complexity and right linear grammars. 281-299 - Henning Bordihn, Markus Holzer:
On the number of active states in finite automata. 301-318 - Supreeti Kamilya, Jarkko Kari:
Nilpotency and periodic points in non-uniform cellular automata. 319-333 - Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
The descriptional power of queue automata of constant length. 335-356 - Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis:
On the size of partial derivatives and the word membership problem. 357-375 - Kenichi Morita:
An instruction set for reversible Turing machines. 377-396 - Friedrich Otto, Matthias Wendlandt:
Reversibility for stateless ordered RRWW-automata. 397-425 - Hiroshi Umeo, Naoki Kamikawa, Gen Fujita:
A new class of the smallest FSSP partial solutions for 1D rings of length n=2k-1. 427-450 - Thomas Worsch:
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds. 451-462
Volume 58, Number 5, October 2021
- Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok:
Complement for two-way alternating automata. 463-495 - Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter Nazier Mosaad, Naijun Zhan:
Indecision and delays are the parents of failure - taming them algorithmically by synthesizing delay-resilient control. 497-528 - Roberto Gorrieri:
Team bisimilarity, and its associated modal logic, for BPP nets. 529-569 - Litan Kumar Das, Kumar Sankar Ray:
Bitopological duality for algebras of Fitting's logic and natural duality extension. 571-584
Volume 58, Number 6, December 2021
- Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Thomas Steeples, Michael J. Wooldridge:
Equilibria for games with combined qualitative and quantitative objectives. 585-610 - Rabia Mazhar, Muddassar Azam Sindhu:
DKL: an efficient algorithm for learning deterministic Kripke structures. 611-651 - Ming Xu, Cheng-Chao Huang, Yuan Feng:
Measuring the constrained reachability in quantum Markov chains. 653-674 - Manuel Gieseking, Ernst-Rüdiger Olderog, Nick Würdemann:
Correction to: Solving high-level Petri games. 675-676 - Walter Vogler, Gerald Lüttgen:
Correction to: A linear-time branching-time perspective on interface automata. 677
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.