Language and Automata Theory and Applications (eBook, PDF)

14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings
Redaktion: Leporati, Alberto; Zandron, Claudio; Shapira, Dana; Martín-Vide, Carlos

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Nature Switzerland
• Seitenzahl: 449
• Erscheinungstermin: 25. Februar 2020
• Englisch
• ISBN-13: 9783030406080
• Artikelnr.: 58715956

Inhaltsangabe

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,+, < ,1) in (R,+, < ,Z).- Ordered Semiautomatic Rings with Applications to Geometry.- Automata.- Boolean monadic recursive schemes as a logical characterization of the subsequential functions.- Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models.- Windable Heads & Recognizing NL with Constant Randomness.- Alternating Finite Automata with Limited Universal Branching.- Pebble-Intervals Automata and FO2 with Two Orders.- Limited Two-Way Deterministic Finite Automata with Advice.- Complexity.- On the size of depth-two threshold circuits for the inner product mod 2 function.- Complexity Issues of String to Graph Approximate Matching.- Complexity of Automatic Sequences.- Grammars.- Context-sensitive Fusion Grammars are Universal.- Cyclic shift on multi-component grammars.- Languages.- The Automatic Baire Property and an Effective Property of omega-Rational Functions.- The Power of Programs over Monoids in J.- Geometrically Closed Positive Varieties of Star-Free Languages.- Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas.- Trees and Graphs.- On the Weisfeiler-Leman Dimension of Fractional Packing.- Input Strictly Local Tree Transducers.- Words and Codes.- Lyndon words versus inverse Lyndon words: queries on su xes and bordered words.- On collapsing pre x normal words.- Simplified Parsing Expression Derivatives.- Complete Variable-Length Codes: AnExcursion into Word Edit Operations.

Kundenbewertungen

Bewertung schreiben Bewertung schreiben

Information zu Bewertungen

Zur Abgabe einer Bewertung ist die Anmeldung in Ihrem Kundenkonto notwendig. Die Authentizität der Kundenbewertungen wird von uns nicht überprüft.

Bewertung schreiben Bewertung schreiben