LEADER 05446nam 22007455 450 001 996418211303316 005 20230329140828.0 010 $a3-030-40608-3 024 7 $a10.1007/978-3-030-40608-0 035 $a(CKB)4100000010480261 035 $a(DE-He213)978-3-030-40608-0 035 $a(MiAaPQ)EBC6193061 035 $a(PPN)242979084 035 $a(EXLCZ)994100000010480261 100 $a20200204d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aLanguage and Automata Theory and Applications$b[electronic resource] $e14th International Conference, LATA 2020, Milan, Italy, March 4?6, 2020, Proceedings /$fedited by Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XI, 449 p. 409 illus., 6 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12038 311 $a3-030-40607-5 327 $aInvited 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. . 330 $aThis 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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12038 606 $aComputer science 606 $aArtificial intelligence 606 $aDatabase management 606 $aComputer systems 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer Science Logic and Foundations of Programming 606 $aArtificial Intelligence 606 $aDatabase Management 606 $aComputer System Implementation 606 $aAlgorithms 606 $aData Science 615 0$aComputer science. 615 0$aArtificial intelligence. 615 0$aDatabase management. 615 0$aComputer systems. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aArtificial Intelligence. 615 24$aDatabase Management. 615 24$aComputer System Implementation. 615 24$aAlgorithms. 615 24$aData Science. 676 $a005.1015113 702 $aLeporati$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMartín-Vide$b Carlos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShapira$b Dana$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZandron$b Claudio$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996418211303316 996 $aLanguage and Automata Theory and Applications$9774044 997 $aUNISA