{"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":35,"n_cols":5,"rows_kept":35,"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],[8,2,8,3],[9,2,9,3],[13,2,13,3],[16,2,16,3],[16,4,16,5],[17,2,17,3],[17,4,17,5],[18,2,18,3],[18,4,18,5],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[29,2,29,3],[30,2,30,3],[32,2,32,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910814177303321"]
[null,null,"Autore",null,"Van Sickle John"]
[null,null,"Titolo",null,"Virgil's Book of bucolics, the ten eclogues translated into English verse : framed by cues for reading aloud and clues for threading texts and themes / / John Van Sickle"]
[null,null,"Pubbl/distr/stampa",null,"Baltimore : , : Johns Hopkins University Press, , 2011"]
[null,null,"ISBN",null,"0-8018-9961-3"]
[null,null,"Descrizione fisica",null,"1 online resource (289 p.)"]
[null,null,"Disciplina",null,"873/.01"]
[null,null,"Soggetti",null,"Pastoral poetry, Latin - History and criticism"]
[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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Cover; Contents; Preface; Note to the Reader; A User Guide to 'pastoral,' 'eclogue,' Eclogues, 'bucolic,' and Bucolics; Themes from Troubled Times at Rome; Cues for Drama: Mime Revoicing Roman Mythic Frame; Eclogue 1. Contrary Fates Clash: Citizen- Singer Silenced {break with former Roman frame and vatic voice} // Old Slave Free to Sing {new Roman framing myth and vatic voice}; Eclogue 2. New Roman Myth Frames Restless Song in Love {love spell builds thematic reach}; Eclogue 3. Erotic-Vatic Singing Swells Mythic Frame {'all' filled by Jove}"]
[{"$nulls":4},"Eclogue 4. Full Vatic Song {myth frames 'all': bucolic, georgic, civic- heroic, cosmic ranges}Eclogue 5. Vatic Hymns Cap Roman Myth {new bucolic-georgic (Roman) hero: Daphnis}; Eclogue 6. Freed Singer-Slave Put Down {AMOR // ROMA: cosmic, tragic, vatic reach}; Eclogue 7. Silenced Singer Drawn Back to Frame {Daphnis-Arcadian verses: restrained voice downs vatic push}; Eclogue 8. Framer Resifts {tragic 'love': Arcadian verse // vatic 'love': spells to get back Daphnis}; Eclogue 9. Roman Mythic Frame and Vatic Song Dispelled {Daphnis minus Roman role}"]
[{"$nulls":4},"Rome minus Annals and Heroic Origin (Catullus)The Warp and Weft of Varying Motifs: Structure Charted; Notes; Bibliography; Index;"]
[null,"2.","Record Nr.",null,"UNINA9910770259503321"]
[null,null,"Autore",null,"Morazán Marco T."]
[null,null,"Titolo",null,"Programming-Based Formal Languages and Automata Theory : Design, Implement, Validate, and Prove / / by Marco T. Morazán"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024"]
[null,null,"ISBN",null,"9783031439735"]
[null,null,"Edizione",null,"[1st ed. 2024.]"]
[null,null,"Descrizione fisica",null,"1 online resource (530 pages)"]
[null,null,"Collana",null,"Texts in Computer Science, , 1868-095X"]
[null,null,"Disciplina",null,"005.131"]
[null,null,"Soggetti",null,"Machine theory"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[{"$nulls":4},"Software Engineering"]
[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,"Part I: Fundamental Concepts -- 1. Introduction to FSM -- 2. Essential Background -- 3. Types of Proofs -- Part II: Regular Languages -- 4. Regular Expressions -- 5. Deterministic Finite-State Machines -- 6. Nondeterministic Finite State Machines -- 7. Finite-State Automatons and Regular Expressions -- 8. Regular Grammars -- 9. Languages that are not Regular -- Part III: Context-Free Languages -- 10. Context-Free Grammars -- 11. Pushdown Automata -- 12. Equivalence of pdas and cfgs -- 13. Properties of Context-Free Languages -- 14. Deterministic PDAs -- Part IV: Context-Sensitive Languages -- 15. Turing Machines -- 16. Turing Machine Composition -- 17. Turing Machine Extensions -- 18. Context-Sensitive Grammars -- 19. Church-Turing Thesis and Undecidability -- 20. Complexity -- Part V: Epilogue -- 21. Where to Go From Here."]
[null,null,null,"Sommario/riassunto","This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II "]
[{"$nulls":4},"starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical."]