Systolic trellis automata: Stability, decidability and complexity

[Lecture Notes in Computer Science] LATI

[Lecture Notes in Computer Science] LATIN 2012: Theoretical Informatics Volume 7256 || Oblivious Two-Way Finite Automata: Decidability and Complexity

✍ Fernández-Baca, David 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 217 KB

This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theore