Controlled finite automataMEDUNA, Alexander; ZEMEK, Petr.Acta informatica. 2014, Vol 51, Num 5, pp 327-337, issn 0001-5903, 11 p.Article

Exploiting a hypergraph model for finding Golomb rulersSORGE, Manuel; MOSER, Hannes; NIEDERMEIER, Rolf et al.Acta informatica. 2014, Vol 51, Num 7, pp 449-471, issn 0001-5903, 23 p.Article

Synthesizing robust systemsBLOEM, Roderick; CHATTERJEE, Krishnendu; GREIMEL, Karin et al.Acta informatica. 2014, Vol 51, Num 3-4, pp 193-220, issn 0001-5903, 28 p.Conference Paper

Compositional type checking of delta-oriented software product linesBETTINI, Lorenzo; DAMIANI, Ferruccio; SCHAEFER, Ina et al.Acta informatica. 2013, Vol 50, Num 2, pp 77-122, issn 0001-5903, 46 p.Article

Conjunctive grammars and alternating pushdown automataAIZIKOWITZ, Tamar; KAMINSKI, Michael.Acta informatica. 2013, Vol 50, Num 3, pp 175-197, issn 0001-5903, 23 p.Article

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automataNAGY, Benedek; OTTO, Friedrich.Acta informatica. 2013, Vol 50, Num 4, pp 229-255, issn 0001-5903, 27 p.Article

Networks of evolutionary processors: the power of subregular filtersDASSOW, Jürgen; MANEA, Florin; TRUTHE, Bianca et al.Acta informatica. 2013, Vol 50, Num 1, pp 41-75, issn 0001-5903, 35 p.Article

Query optimization in information integrationDONGFENG CHEN; CHIRKOVA, Rada; SADRI, Fereidoon et al.Acta informatica. 2013, Vol 50, Num 4, pp 257-287, issn 0001-5903, 31 p.Article

An efficient algorithm for finding ideal schedulesCOFFMAN, Edward G; DERENIOWSKI, Dariusz; KUBIAK, Wiestaw et al.Acta informatica. 2012, Vol 49, Num 1, pp 1-14, issn 0001-5903, 14 p.Article

Does indirect addressing matter? A noteBRAND, Michael.Acta informatica. 2012, Vol 49, Num 7-8, pp 485-491, issn 0001-5903, 7 p.Article

Finding vertex-surjective graph homomorphismsGOLOVACH, Petr A; LIDICKY, Bernard; MARTIN, Barnaby et al.Acta informatica. 2012, Vol 49, Num 6, pp 381-394, issn 0001-5903, 14 p.Article

Inefficiency of equilibria for the machine covering game on uniform machinesZHIYI TAN; LONG WAN; QI ZHANG et al.Acta informatica. 2012, Vol 49, Num 6, pp 361-379, issn 0001-5903, 19 p.Article

On the power of enzymatic numerical P systemsIOAN VASILE, Cristian; BRANDUSA PAVEL, Ana; DUMITRACHE, Ioan et al.Acta informatica. 2012, Vol 49, Num 6, pp 395-412, issn 0001-5903, 18 p.Article

Stochastic game logicBAIER, Christel; BRAZDIL, Tomáš; GRÖSSER, Marcus et al.Acta informatica. 2012, Vol 49, Num 4, pp 203-224, issn 0001-5903, 22 p.Article

Avoidable binary patterns in partial wordsBLANCHET-SADRI, F; MERCAS, Robert; SIMMONS, Sean et al.Acta informatica. 2011, Vol 48, Num 1, pp 25-41, issn 0001-5903, 17 p.Article

MAT learners for tree series: an abstract data type and two realizationsDREWES, Frank; HÖGBERG, Johanna; MALETTI, Andreas et al.Acta informatica. 2011, Vol 48, Num 3, pp 165-189, issn 0001-5903, 25 p.Article

On α₂ ― ν₂-products of automataDÖMÖISI, Pál; MAROTI, György.Acta informatica. 2011, Vol 48, Num 7-8, pp 397-408, issn 0001-5903, 12 p.Article

M/M/1 retrial queue with working vacationsVAN DO, Tien.Acta informatica. 2010, Vol 47, Num 1, pp 67-75, issn 0001-5903, 9 p.Article

Reachability results for timed automata with unbounded data structuresLANOTTE, Ruggero; MAGGIOLO-SCHETTINI, Andrea; TROINA, Angelo et al.Acta informatica. 2010, Vol 47, Num 5-6, pp 279-311, issn 0001-5903, 33 p.Article

A theory of structural stationarity in the π-CalculusMEYER, Roland.Acta informatica. 2009, Vol 46, Num 2, pp 87-137, issn 0001-5903, 51 p.Article

Exploiting colored Petri nets to decide on permutation admissibilityBASHIROV, Rza; KORDON, Fabrice; LORT, Hiiseyin et al.Acta informatica. 2009, Vol 46, Num 1, pp 43-55, issn 0001-5903, 13 p.Article

Final and sequential behaviours of M-automataCIOBANU, Gabriel; RUDEANU, Sergiu.Acta informatica. 2009, Vol 46, Num 5, pp 361-374, issn 0001-5903, 14 p.Article

On regular tree languages and deterministic pushdown automataJANOUSEK, Jan; MELICHAR, Bořivoj.Acta informatica. 2009, Vol 46, Num 7, pp 533-547, issn 0001-5903, 15 p.Article

The maximum gain of increasing the number of preemptions in multiprocessor schedulingKLONOWSKA, Kamilla; LUNDBERG, Lars; LENNERSTAD, Hakan et al.Acta informatica. 2009, Vol 46, Num 4, pp 285-295, issn 0001-5903, 11 p.Article

Extended multi bottom-up tree transducers Composition and decompositionENGELFRIET, Joost; LILIN, Eric; MALETTI, Andreas et al.Acta informatica. 2009, Vol 46, Num 8, pp 561-590, issn 0001-5903, 30 p.Article