Computing the 2-blocks of directed graphs p. 93 Raed Jaberi Published online: 16 April 2015 DOI: https://doi.org/10.1051/ita/2015001 AbstractPDF (392.0 KB)References
An upper bound on the complexity of recognizable tree languages p. 121 Olivier Finkel, Dominique Lecomte and Pierre Simonnet Published online: 27 April 2015 DOI: https://doi.org/10.1051/ita/2015002 AbstractPDF (264.1 KB)References
Towards using the history in online computation with advice p. 139 Sacha Krug Published online: 27 April 2015 DOI: https://doi.org/10.1051/ita/2015003 AbstractPDF (248.7 KB)References
Linear grammars with one-sided contexts and their automaton representation p. 153 Mikhail Barash and Alexander Okhotin Published online: 08 July 2015 DOI: https://doi.org/10.1051/ita/2015004 AbstractPDF (693.8 KB)References