Cover Image
Read Now

Language and Automata Theory and Applications 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings

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 202...

Full description

Bibliographic Details
Other Authors: Leporati, Alberto (Editor), Martín-Vide, Carlos (Editor), Shapira, Dana (Editor), Zandron, Claudio (Editor)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2020, 2020
Edition:1st ed. 2020
Series:Theoretical Computer Science and General Issues
Subjects:
Artificial Intelligence / Data Processing
Computer Systems
Computer Science Logic And Foundations Of Programming
Computer Science
Computer System Implementation
Artificial Intelligence
Algorithms
Database Management
Data Science
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04328nmm a2200445 u 4500
001 EB001894372
003 EBX01000000000000001057519
005 00000000000000.0
007 cr|||||||||||||||||||||
008 200303 ||| eng
020 |a 9783030406080 
100 1 |a Leporati, Alberto  |e [editor] 
245 0 0 |a Language and Automata Theory and Applications  |h Elektronische Ressource  |b 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings  |c edited by Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron 
250 |a 1st ed. 2020 
260 |a Cham  |b Springer International Publishing  |c 2020, 2020 
300 |a XI, 449 p. 409 illus., 6 illus. in color  |b online resource 
505 0 |a 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 --  
505 0 |a Simplified Parsing Expression Derivatives -- Complete Variable-Length Codes: AnExcursion into Word Edit Operations. 
505 0 |a 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 --  
653 |a Artificial intelligence / Data processing 
653 |a Computer systems 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Computer science 
653 |a Computer System Implementation 
653 |a Artificial Intelligence 
653 |a Algorithms 
653 |a Database Management 
653 |a Artificial intelligence 
653 |a Database management 
653 |a Data Science 
700 1 |a Martín-Vide, Carlos  |e [editor] 
700 1 |a Shapira, Dana  |e [editor] 
700 1 |a Zandron, Claudio  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-030-40608-0 
856 4 0 |u https://doi.org/10.1007/978-3-030-40608-0?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a 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. 

Similar Items