000 05382nam a22006495i 4500
001 978-3-030-40608-0
003 DE-He213
005 20240730171048.0
007 cr nn 008mamaa
008 200204s2020 sz | s |||| 0|eng d
020 _a9783030406080
_9978-3-030-40608-0
024 7 _a10.1007/978-3-030-40608-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aLanguage and Automata Theory and Applications
_h[electronic resource] :
_b14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings /
_cedited by Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXI, 449 p. 409 illus., 6 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12038
505 0 _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: AnExcursion into Word Edit Operations. .
520 _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. .
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aDatabase management.
_93157
650 0 _aComputer systems.
_996928
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aDatabase Management.
_93157
650 2 4 _aComputer System Implementation.
_938514
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
700 1 _aLeporati, Alberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_996931
700 1 _aMartín-Vide, Carlos.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_996933
700 1 _aShapira, Dana.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_996935
700 1 _aZandron, Claudio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_996937
710 2 _aSpringerLink (Online service)
_996939
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030406073
776 0 8 _iPrinted edition:
_z9783030406097
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12038
_996941
856 4 0 _uhttps://doi.org/10.1007/978-3-030-40608-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87379
_d87379