國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Language and Automata Theory and Applications/ edited by Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron.
Reminder of title:	14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings /
other author:	Leporati, Alberto.
Description:	XI, 449 p. 409 illus., 6 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer logic. -
Online resource:	https://doi.org/10.1007/978-3-030-40608-0
ISBN:	9783030406080

Language and Automata Theory and Applications = 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings /
Language and Automata Theory and Applications14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings /[electronic resource] :edited by Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron. - 1st ed. 2020. - XI, 449 p. 409 illus., 6 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12038. - Theoretical Computer Science and General Issues ;9163.

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

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

ISBN: 9783030406080

Standard No.: 10.1007/978-3-030-40608-0doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Language and Automata Theory and Applications = 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings /
LDR:04277nam a22004335i 4500 001 1023205
003 DE-He213
005 20200629120919.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030406080 $9 978-3-030-40608-0
024 7 $a 10.1007/978-3-030-40608-0 $2 doi
035 $a 978-3-030-40608-0
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Language and Automata Theory and Applications $h [electronic resource] : $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.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XI, 449 p. 409 illus., 6 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12038
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 -- 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. .
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. .
650 0 $a Computer logic. $3 786340
650 0 $a Artificial intelligence. $3 559380
650 0 $a Database management. $3 557799
650 0 $a Architecture, Computer. $3 1255731
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Database Management. $3 669820
650 2 4 $a Computer System Implementation. $3 669803
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
700 1 $a Leporati, Alberto. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 786266
700 1 $a Martín-Vide, Carlos. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258335
700 1 $a Shapira, Dana. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1201883
700 1 $a Zandron, Claudio. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 675078
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030406073
776 0 8 $i Printed edition: $z 9783030406097
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-40608-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)