This book constitutes the proceedings of the 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, which took place in Puerto Varas, Chile, in March 2024. The 44 papers presented in this volume were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows:Part I: Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory; Part II: Combinatorics and Graph Theory; Parameterized Algorithms; Automata Theory and Formal Languages; and Game Theory and Fairness.

This book constitutes the proceedings of the 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, which took place in Puerto Varas, Chile, in March 2024. The 44 papers presented in this volume were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows:Part I: Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory; Part II: Combinatorics and Graph Theory; Parameterized Algorithms; Automata Theory and Formal Languages; and Game Theory and Fairness.

This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

This reference discusses how automata and language theory can be used to understand solutions to solving equations in groups and word problems in groups. Examples presented include, how Fine scale complexity theory has entered group theory via these connections and how cellular automata, has been generalized into a group theoretic setting. Chapters written by experts in group theory and computer science explain these connections.