Language and Automata Theory and Applications : 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings /: 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings. (2020)

• Record Type: Book
• Further Information: Note: Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron.
• Editors: Leporati, Alberto; Martín Vide, Carlos; Shapira, Dana; Zandron, Claudio
• Contents: 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: An Excursion into Word Edit Operations.
• Publisher Details: Cham : Springer
• Publication Date: 2020
• Copyright Date: 2020
• Extent: 1 online resource (449 pages)
• Subjects: Computer science; Computer logic; Artificial intelligence; Database management; Architecture, Computer; Algorithms; Data structures (Computer science); Computers -- Intelligence (AI) & Semantics; Computers -- Database Management -- General; Computers -- Information Technology; Computers -- Programming -- Algorithms; Computers -- Data Modeling & Design; Artificial intelligence; Databases; Systems analysis & design; Algorithms & data structures; Computers -- Programming -- General; Computer programming / software development
• Languages: English
• ISBNs: 9783030406080
• Related ISBNs: 9783030406073
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.