LEADER 00905nam0-2200313---450- 001 990009408080403321 005 20110907111812.0 010 $a978-0-8020-9327-1 035 $a000940808 035 $aFED01000940808 035 $a(Aleph)000940808FED01 035 $a000940808 100 $a20110728d2008----km-y0itay50------ba 101 0 $aeng 102 $aCA 105 $aa-------001yy 200 1 $aUkraine and Russia$erepresentations of the past$fSerhii Plokhy 210 $aToronto [etc.]$cUniversity of Toronto press$d2008 215 $axix, 391 p.$cill.$d24 cm 610 0 $aIdentita nazionale$aUcraina$aSec. 19.-20. 676 $a947.7084$v21$zita 700 1$aPlokhy,$bSerhii$0296244 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a990009408080403321 952 $aXIV F 352$b47071$fFSPBC 959 $aFSPBC 996 $aUkraine and Russia$9764532 997 $aUNINA LEADER 07094nam 22006975 450 001 996466020803316 005 20230405225152.0 010 $a3-642-00982-4 024 7 $a10.1007/978-3-642-00982-2 035 $a(CKB)1000000000718133 035 $a(SSID)ssj0000318611 035 $a(PQKBManifestationID)11249845 035 $a(PQKBTitleCode)TC0000318611 035 $a(PQKBWorkID)10311047 035 $a(PQKB)10352569 035 $a(DE-He213)978-3-642-00982-2 035 $a(MiAaPQ)EBC3064055 035 $a(PPN)134126572 035 $a(EXLCZ)991000000000718133 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLanguage and Automata Theory and Applications$b[electronic resource] $eThird International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings /$fedited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XV, 754 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5457 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-00981-6 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Recent Developments in Algorithmic Teaching -- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications -- Descriptional and Computational Complexity of Finite Automata -- Hypothesis Spaces for Learning -- State Complexity of Nested Word Automata -- Regular Papers -- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations -- Minimal Union-Free Decompositions of Regular Languages -- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory -- Matching Trace Patterns with Regular Policies -- Absolute Convergence of Rational Series Is Semi-decidable -- Non-solvable Groups Are Not in FO+MOD+MĀJ2[REG] -- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights -- Refinement and Consistency of Timed Modal Specifications -- Nondeterministic Instance Complexity and Proof Systems with Advice -- How Many Holes Can an Unbordered Partial Word Contain? -- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms -- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization -- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication -- Picture Languages Generated by Assembling Tiles -- Undecidability of Operation Problems for T0L Languages and Subclasses -- Decision Problems for Convex Languages -- On a Family of Morphic Images of Arnoux-Rauzy Words -- Monadic Datalog Tree Transducers -- On Extended Regular Expressions -- Multi-tilde Operators and Their Glushkov Automata -- Non-uniform Cellular Automata -- A Cryptosystem Based on the Composition of Reversible Cellular Automata -- Grammars Controlled by Special Petri Nets -- Nested Counters in Bit-Parallel String Matching -- Bounded Delay and Concurrency for Earliest Query Answering -- Learning by Erasing in Dynamic Epistemic Logic -- The Fault Tolerance of NP-Hard Problems -- Termination of Priority Rewriting -- State Complexity of Combined Operations for Prefix-Free Regular Languages -- Towards a Taxonomy for ECFG and RRPG Parsing -- Counting Parameterized Border Arrays for a Binary Alphabet -- Bounded Hairpin Completion -- Rigid Tree Automata -- Converting Self-verifying Automata into Deterministic Automata -- Two Equivalent Regularizations for Tree Adjoining Grammars -- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching -- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata -- Automata on Gauss Words -- Analysing Complexity in Classes of Unary Automatic Structures -- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words -- Segmentation Charts for Czech ? Relations among Segments in Complex Sentences -- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions -- Efficiency of the Symmetry Bias in Grammar Acquisition -- A Series of Run-Rich Strings -- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes -- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates -- Prediction of Creole Emergence in Spatial Language Dynamics -- On the Average Size of Glushkov?s Automata -- Tiling the Plane with a Fixed Number of Polyominoes -- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality -- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata -- Finitely Generated Synchronizing Automata -- Genetic Algorithm for Synchronization -- Constructing Infinite Words of Intermediate Arithmetical Complexity -- From Gene Trees to Species Trees through a Supertree Approach -- A Kleene Theorem for Forest Languages -- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions -- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. 330 $aThis book constitutes the refereed proceedings of the Third International Conference on Language and Automata Theory and Applications, LATA 2009, held in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5457 606 $aMachine theory 606 $aComputer science 606 $aComputer science?Mathematics 606 $aFormal Languages and Automata Theory 606 $aTheory of Computation 606 $aSymbolic and Algebraic Manipulation 606 $aComputer Science Logic and Foundations of Programming 606 $aMathematics of Computing 615 0$aMachine theory. 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 14$aFormal Languages and Automata Theory. 615 24$aTheory of Computation. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aMathematics of Computing. 676 $a005.131 702 $aDediu$b Adrian Horia$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aIonescu$b Armand Mihai$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMartin-Vide$b Carlos$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLATA 2009 906 $aBOOK 912 $a996466020803316 996 $aLanguage and Automata Theory and Applications$9774044 997 $aUNISA LEADER 01167nam0 22002771i 450 001 UON00055886 005 20231205102246.398 100 $a20020107d1969 |0itac50 ba 101 $aspa 102 $aES 105 $a|||| 1|||| 200 1 $aNarraciones arabes del siglo 20. / seleccion, traduccion presentacion y notas Maria Jesus Viguera y Marcelino Villegas 210 $aMadrid$cMagisterio Espanol$d1969 215 $a169 p.$d18 cm 620 $aES$dMadrid$3UONL000218 686 $aARA VI CAX$cPAESI ARABI - LETTERATURA MODERNA E CONTEMPORANEA - TESTI - PROSA$2A 700 1$aVIGUERA$bMaria Jesus$3UONV030750$0653146 701 1$aVILLEGAS$bMarcelino$3UONV035578$0653147 712 $aMagisterio Espanol$3UONV254846$4650 790 1$aVIGUERA, Maria J.$zVIGUERA, Maria Jesus$3UONV199067 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00055886 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI ARA VI Cax 006 $eSI SA 26128 7 006 996 $aNarraciones arabes del siglo 20$91148929 997 $aUNIOR