{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":39,"n_cols":5,"rows_kept":39,"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],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[9,2,9,3],[10,2,10,3],[13,2,13,3],[14,2,14,3],[18,2,18,3],[19,2,19,3],[19,4,19,5],[20,2,20,3],[20,4,20,5],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[33,2,33,3],[34,2,34,3],[37,2,37,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910465044203321"]
[null,null,"Autore",null,"Schwegler Armin <1955->"]
[null,null,"Titolo",null,"Analyticity and syntheticity : a diachronic perspective with special reference to Romance languages / / by Armin Schwegler"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; New York : , : Mouton de Gruyter, , 1990"]
[null,null,"ISBN",null,"3-11-087292-7"]
[null,null,"Edizione",null,"[Reprint 2012]"]
[null,null,"Descrizione fisica",null,"1 online resource (308 pages) : illustrations"]
[null,null,"Collana",null,"Empirical Approaches to Language Typology [EALT] ; ; 6"]
[{"$nulls":4},"Empirical approaches to language typology ; ; 6"]
[null,null,"Disciplina",null,"440"]
[null,null,"Soggetti",null,"Romance languages - Syntax"]
[{"$nulls":4},"Romance languages - Grammar, Historical"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Revision of the author's thesis (Ph. D.--University of California, Berkeley, 1986)."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (pages [245]-278) and indexes."]
[null,null,"Nota di contenuto",null,"Frontmatter -- Contents -- Preface -- Introduction -- Abbreviations -- Chapter one. History of the terms \"analytic\" and \"synthetic\" -- Chapter two. Word delimitation: in search of a universal -- Chapter three. Fishing out the baby: The usefulness of the terms analyticity/syntheticity in diachronic description -- Chapter four. The verbal core from Latin to French: Part 1: The marking of person/number: from synthetic to analytic? -- Chapter five. The verbal core from Latin to French: Part 2: Periphrastic cantare habeo, habeo cantatum, and je vais chanter -- Chapter six. Synthesis in non-contiguous elements: predicate negation in Romance -- Chapter seven. On drift, cyclicity, reconstruction, and the motives for changes in the analytic/synthetic spectrum -- Conclusion -- Notes -- Bibliography -- Subject Index -- Author Index -- Backmatter"]
[null,"2.","Record Nr.",null,"UNISA996465422103316"]
[null,null,"Titolo",null,"1. Fachtagung über Automatentheorie und Formale Sprachen [[electronic resource] ] : GI. Gesellschaft für Informatik e.V. Bonn, 9.-12. Juli 1973 / / herausgegeben von Karl-Heinz Böhling, Klaus Indermark"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1973"]
[null,null,"ISBN",null,"3-540-37826-X"]
[null,null,"Edizione",null,"[1st ed. 1973.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 330 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2"]
[null,null,"Disciplina",null,"005.11"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"On the structure of algorithmic problems -- A mathematical model of digital computers -- On some recent problems concerning developmental languages -- Fault-tolerance and stability of fuzzy-state automata -- Bemerkungen über Homomorphismen endlicher in lineare Automaten -- Der Kaskadenzerlegungssatz für Halbautomaten -- Konvergenzbetrachtungen bei der Vorhersage des Ausgabeverhaltens allgemeiner stochastischer Systeme -- Ketten und arithmetische Prädikate von endlichen Automaten -- Une hierarchie infinie de cones d'Accepteurs verificateurs -- Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten -- Ein automatentheoretisches Modell einer Speicherhierarchie -- Deterministic one-counter automata -- The use of metric and uniform spaces for the formalization of behavioral proximity of states -- Quelques generateurs des langages algebriques -- Une caracterisation des langages quasi-rationnels standards -- Der Einfluss von Kontext auf spezielle CF-Grammatiken -- Zur Komplexität gesteuerter kontextfreier Ersetzungen -- Characterization of derivation sets of formal systems -- Die Darstellung indizierter Sprachen durch Ausdrücke -- Codes and aperiodic languages -- The characterization "]
[{"$nulls":4},"of certain classes of languages in the context sensitive area by automata -- A characterization of boolean closures of families of languages -- Zufällige Folgen und Bi-Immunität -- Die mittler Additionsdauer eines Paralleladdierwerks -- On the number of multiplications required by the product of two matrices -- Elementare und subelementare Funktionenklassen über binären Bäumen -- Über die Vernetzungsstruktur von Maschinen -- On the simulation of time bounded machines -- Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen -- Über eine Hierarchie von Push-Down-Entscheidbaren Mengen -- A characterization of the classes L1 and R1 of primitive recursive word functions -- A drum scheduling algorithm -- Some considerations about classes of mappings between context-free derivation systems -- On ianov schemas with one memory location -- Reduction goals in bottom-up recognition -- Un modele semantique pour un langage simple de programmation -- Erweiterungen subrekursiver Programmiersprachen."]