{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[18,2,18,3],[19,2,19,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996464399003316"]
[null,null,"Titolo",null,"Developments in Language Theory [[electronic resource] ] : 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings / / edited by Nelma Moreira, Rogério Reis"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021"]
[null,null,"ISBN",null,"3-030-81508-0"]
[null,null,"Edizione",null,"[1st ed. 2021.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVII, 381 p. 52 illus., 12 illus. in color.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12811"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Machine theory"]
[{"$nulls":4},"Logic programming"]
[{"$nulls":4},"Database management"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[{"$nulls":4},"Logic in AI"]
[{"$nulls":4},"Database Management"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Invited Talks -- Morphic sequences versus automatic sequences -- Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective -- Regular Papers -- A strong non-overlapping Dyck code -- Active Learning of Sequential Transducers with Side Information about the Domain -- Compositions of Constant Weighted Extended Tree Transducers -- Extremal Binary PFAs in a Cerny Family -- Variations on the Post Correspondence Problem for Free Groups -- Reducing local alphabet size in recognizable picture languages -- Properties of Graphs Specified by a Regular Language -- Balanced-by-construction regular and omega-regular languages -- Weighted Prefix Normal Words: Mind the Gap -- Two-Way Non-Uniform Finite Automata -- Integer Weighted Automata on Infinite Words -- Deciding FO2 Alternation for Automata over Finite and Infinite Words -- State Complexity of Projection on Languages "]
[{"$nulls":4},"Recognized by Permutation Automata and Commuting Letters -- Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata -- Lyndon words formalized in Isabelle/HOL -- The Range of State Complexities of Languages Resulting from the Cascade Product—The General Case (Extended Abstract) -- Second-order finite automata: expressive power and simple proofs using automatic structures -- Reversible Top-Down Syntax Analysis -- Symmetry groups of infinite words -- Bounded Languages Described by GF(2)-grammas -- Definability Results for Top-Down Tree Transducers -- The hardest LL(k) language -- Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings -- Branching Frequency and Markov Entropy of Repetition-Free Languages -- A Linear-time Simulation of Deterministic d-Limited Automata -- Caratheodory Extensions of Subclasses of Regular Languages -- Parikh Word Representable Graphs and Morphisms."]
[null,null,null,"Sommario/riassunto","This book constitutes the proceedings of the 25th International Conference on Developments in Language Theory, DLT 2021, which was held in Porto, Portugal, during August 16-20, 2021. The conference took place in an hybrid format with both in-person and online participation. The 27 full papers included in these proceedings were carefully reviewed and selected from 48 submissions. The DLT conference series provides a forum for presenting current developments in formal languages and automata. Its scope is very general and includes, among others, the following topics and areas: grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; eﬃcient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; quantum computing. The book also includes 3 invited talks in full paper length. ."]