default search action
Acta Informatica, Volume 48
Volume 48, Number 1, February 2011
- Zheng-Zhu Li, Y. S. Tsai:
Some properties of the disjunctive languages contained in Q. 1-18 - Juha Honkala:
A characterization of rational D0L power series. 19-24 - Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
Avoidable binary patterns in partial words. 25-41 - Victor Mitrana, Cristina Tîrnauca:
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries. 43-50 - Md. Enamul Kabir, Hua Wang, Elisa Bertino:
Efficient systematic clustering method for k-anonymization. 51-66
Volume 48, Number 2, April 2011
- Alex A. Aravind, Wim H. Hesselink:
Nonatomic dual bakery algorithm with bounded tokens. 67-96 - Ana Cavalcanti, Marie-Claude Gaudel:
Testing for refinement in Circus. 97-147
Volume 48, Number 3, May 2011
- Alexander Meduna, Petr Zemek:
One-sided random context grammars. 149-163 - Frank Drewes, Johanna Högberg, Andreas Maletti:
MAT learners for tree series: an abstract data type and two realizations. 165-189 - Daniel Seidel, Janis Voigtländer:
Refined typing to localize the impact of forced strictness on free theorems. 191-211
Volume 48, Number 4, July 2011
- Artem Polyvyanyy, Matthias Weidlich, Mathias Weske:
Connectivity of workflow nets: the foundations of stepwise verification. 213-242 - Tien Van Do, Ram Chakka, Nam H. Do, László Pap:
A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment. 243-269
Volume 48, Numbers 5-6, August 2011
- Daowen Qiu, Lvzhou Li, Xiangfu Zou, Paulo Mateus, Jozef Gruska:
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. 271-290 - Markus N. Rabe, Sven Schewe:
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. 291-315 - Sándor Vágvölgyi:
CHAP and rewrite components. 317-361
Volume 48, Numbers 7-8, December 2011
- Juan Ignacio Perna, Jim Woodcock, Augusto Sampaio, Juliano Iyoda:
Correct hardware synthesis - An algebraic approach. 363-396 - Pál Dömösi, György Maróti:
On α 2 - ν 2-products of automata. 397-408 - Bogdan Aman, Gabriel Ciobanu:
Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems. 409-415 - Amit Chakrabarti, Venkatesan Guruswami, Andrew Wirth, Anthony Wirth:
The query complexity of estimating weighted averages. 417-426
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.