- Mark Mercer:
Lower Bounds for Generalized Quantum Finite Automata. LATA 2008: 373-384 - Malgorzata Moczurad, Wlodzimierz Moczurad:
How Many Figure Sets Are Codes?. LATA 2008: 385-396 - Etsuro Moriya, Friedrich Otto:
On Alternating Phrase-Structure Grammars. LATA 2008: 397-408 - Friedrich Otto, Martin Plátek:
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. LATA 2008: 409-420 - Alexander Perekrestenko:
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard. LATA 2008: 421-432 - Holger Petersen:
Sorting and Element Distinctness on One-Way Turing Machines. LATA 2008: 433-439 - Hong Phuong Le, Nguyên Thi Minh Huyên, Azim Roussanaly, Hô Tuòng Vinh:
A Hybrid Approach to Word Segmentation of Vietnamese Texts. LATA 2008: 240-249 - Svetlana Puzynina:
On Periodicity of Generalized Two-Dimensional Words. LATA 2008: 440-451 - Damien Regnault, Nicolas Schabanel, Eric Thierry:
On the Analysis of "Simple" 2D Stochastic Cellular Automata. LATA 2008: 452-463 - Elaine Render, Mark Kambites:
Polycyclic and Bicyclic Valence Automata. LATA 2008: 464-475 - Arto Salomaa, Kai Salomaa, Sheng Yu:
Length Codes, Products of Languages and Primality. LATA 2008: 476-486 - Benjamin Steinberg:
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg. LATA 2008: 6-10 - Mikhail V. Volkov:
Synchronizing Automata and the Cerny Conjecture. LATA 2008: 11-27 - Ryo Yoshinaka:
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. LATA 2008: 487-498 - Carlos Martín-Vide, Friedrich Otto, Henning Fernau:
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Lecture Notes in Computer Science 5196, Springer 2008, ISBN 978-3-540-88281-7 [contents]