International Journal of Foundations of Computer Science, Volume 29
Volume 29, Number 1, January 2018
: On Basic Properties of Jumping Finite Automata. 1-16
: Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. 17-62
Volume 29, Number 2, February 2018
Developments in Language Theory (DLT 2015)
Volume 29, Number 3, April 2018
Volume 29, Number 4, June 2018
Special Issue - 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016)
Volume 29, Number 5, August 2018
: Complementation of Branching Automata for Scattered and Countable N-Free Posets.
: Compositions of Tree-to-Tree Statistical Machine Translation Models.
Volume 29, Number 6, September 2018
Volume 29, Number 7, November 2018
Wen Chean Teh
: Compositions of Functions and Permutations Specified by Minimal Reaction Systems.
: Context-Freeness of Parsing Expression Languages is Undecidable.
Mostafa Nouri Baygi
: The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem.
Volume 29, Number 8, December 2018
, founded at