Language and Automata Theory and Applications

This book constitutes the proceedings of the 14th International Conference on Language and Automata Theory and Applications, LATA 2020, which was planned to be held in Milan, Italy, in March 2020. Due to the corona pandemic, the actual conference was postponed and will be held together with LATA 2021. The 26 full papers presented in this volume were carefully reviewed and selected from 59 submissions. They were organized in topical sections named: algebraic structures; automata; complexity; grammars; languages; trees and graphs; and words and codes. The book also contains 6 invited papers in full-paper length.

Inhalt

Invited papers.- The New Complexity Landscape around Circuit Minimization.- Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.- Approaching Arithmetic Theories with Finite-State Automata.- Recompression: technique for word equations and compressed data.- How to prove that a language is regular or star-free.- Deciding classes of regular languages: the covering approach.- Algebraic Structures.- Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles Over the Circle.- Deciding (R,+,