Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)
Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)
Resource Information
The item Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 This 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
 Language

 eng
 eng
 Edition
 1st ed. 2009.
 Extent
 1 online resource (XV, 754 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Invited Talks
 Recent Developments in Algorithmic Teaching
 Monadic SecondOrder 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 LanguageBased Comparison of Extensions of Petri Nets with and without WholePlace Operations
 Minimal UnionFree 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 Semidecidable
 Nonsolvable Groups Are Not in FO+MOD+MÂJ2[REG]
 Reoptimization of Traveling Salesperson Problems: Changing Single EdgeWeights
 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 StateSpace 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 ArnouxRauzy Words
 Monadic Datalog Tree Transducers
 On Extended Regular Expressions
 Multitilde Operators and Their Glushkov Automata
 Nonuniform Cellular Automata
 A Cryptosystem Based on the Composition of Reversible Cellular Automata
 Grammars Controlled by Special Petri Nets
 Nested Counters in BitParallel String Matching
 Bounded Delay and Concurrency for Earliest Query Answering
 Learning by Erasing in Dynamic Epistemic Logic
 The Fault Tolerance of NPHard Problems
 Termination of Priority Rewriting
 State Complexity of Combined Operations for PrefixFree 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 Selfverifying Automata into Deterministic Automata
 Two Equivalent Regularizations for Tree Adjoining Grammars
 Selfoverlapping Occurrences and KnuthMorrisPratt Algorithm for Weighted Matching
 Membership Testing: Removing Extra Stacks from Multistack 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 ContextFree Grammars Regulated by Context Conditions
 Efficiency of the Symmetry Bias in Grammar Acquisition
 A Series of RunRich 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
 OneClock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
 Isbn
 9783642009822
 Label
 Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings
 Title
 Language and Automata Theory and Applications
 Title remainder
 Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings
 Statement of responsibility
 edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide
 Language

 eng
 eng
 Summary
 This 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
 Dewey number
 005.131
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 c9l4BypSDNU
 m0tq1MeJ9nY
 _wLNOidsNtg
 Image bit depth
 0
 Language note
 English
 LC call number
 QA8.910.3
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2009
 http://bibfra.me/vocab/lite/meetingName
 LATA 2009
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 LATA 2009
 Dediu, Adrian Horia.
 Ionescu, Armand Mihai.
 MartinVide, Carlos.
 Series statement
 Theoretical Computer Science and General Issues
 Series volume
 5457
 http://library.link/vocab/subjectName

 Mathematical logic
 Computers
 Computer science—Mathematics
 Computer logic
 Mathematical Logic and Formal Languages
 Theory of Computation
 Symbolic and Algebraic Manipulation
 Logics and Meanings of Programs
 Mathematics of Computing
 Computation by Abstract Devices
 Label
 Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Invited Talks  Recent Developments in Algorithmic Teaching  Monadic SecondOrder 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 LanguageBased Comparison of Extensions of Petri Nets with and without WholePlace Operations  Minimal UnionFree 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 Semidecidable  Nonsolvable Groups Are Not in FO+MOD+MÂJ2[REG]  Reoptimization of Traveling Salesperson Problems: Changing Single EdgeWeights  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 StateSpace 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 ArnouxRauzy Words  Monadic Datalog Tree Transducers  On Extended Regular Expressions  Multitilde Operators and Their Glushkov Automata  Nonuniform Cellular Automata  A Cryptosystem Based on the Composition of Reversible Cellular Automata  Grammars Controlled by Special Petri Nets  Nested Counters in BitParallel String Matching  Bounded Delay and Concurrency for Earliest Query Answering  Learning by Erasing in Dynamic Epistemic Logic  The Fault Tolerance of NPHard Problems  Termination of Priority Rewriting  State Complexity of Combined Operations for PrefixFree 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 Selfverifying Automata into Deterministic Automata  Two Equivalent Regularizations for Tree Adjoining Grammars  Selfoverlapping Occurrences and KnuthMorrisPratt Algorithm for Weighted Matching  Membership Testing: Removing Extra Stacks from Multistack 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 ContextFree Grammars Regulated by Context Conditions  Efficiency of the Symmetry Bias in Grammar Acquisition  A Series of RunRich 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  OneClock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
 Dimensions
 unknown
 Edition
 1st ed. 2009.
 Extent
 1 online resource (XV, 754 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783642009822
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/9783642009822
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000718133
 (SSID)ssj0000318611
 (PQKBManifestationID)11249845
 (PQKBTitleCode)TC0000318611
 (PQKBWorkID)10311047
 (PQKB)10352569
 (DEHe213)9783642009822
 (MiAaPQ)EBC3064055
 (EXLCZ)991000000000718133
 Label
 Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Invited Talks  Recent Developments in Algorithmic Teaching  Monadic SecondOrder 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 LanguageBased Comparison of Extensions of Petri Nets with and without WholePlace Operations  Minimal UnionFree 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 Semidecidable  Nonsolvable Groups Are Not in FO+MOD+MÂJ2[REG]  Reoptimization of Traveling Salesperson Problems: Changing Single EdgeWeights  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 StateSpace 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 ArnouxRauzy Words  Monadic Datalog Tree Transducers  On Extended Regular Expressions  Multitilde Operators and Their Glushkov Automata  Nonuniform Cellular Automata  A Cryptosystem Based on the Composition of Reversible Cellular Automata  Grammars Controlled by Special Petri Nets  Nested Counters in BitParallel String Matching  Bounded Delay and Concurrency for Earliest Query Answering  Learning by Erasing in Dynamic Epistemic Logic  The Fault Tolerance of NPHard Problems  Termination of Priority Rewriting  State Complexity of Combined Operations for PrefixFree 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 Selfverifying Automata into Deterministic Automata  Two Equivalent Regularizations for Tree Adjoining Grammars  Selfoverlapping Occurrences and KnuthMorrisPratt Algorithm for Weighted Matching  Membership Testing: Removing Extra Stacks from Multistack 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 ContextFree Grammars Regulated by Context Conditions  Efficiency of the Symmetry Bias in Grammar Acquisition  A Series of RunRich 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  OneClock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
 Dimensions
 unknown
 Edition
 1st ed. 2009.
 Extent
 1 online resource (XV, 754 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783642009822
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/9783642009822
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000718133
 (SSID)ssj0000318611
 (PQKBManifestationID)11249845
 (PQKBTitleCode)TC0000318611
 (PQKBWorkID)10311047
 (PQKB)10352569
 (DEHe213)9783642009822
 (MiAaPQ)EBC3064055
 (EXLCZ)991000000000718133
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/LanguageandAutomataTheoryandApplications/42ymlcAmSps/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/LanguageandAutomataTheoryandApplications/42ymlcAmSps/">Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/LanguageandAutomataTheoryandApplications/42ymlcAmSps/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/LanguageandAutomataTheoryandApplications/42ymlcAmSps/">Language and Automata Theory and Applications : Third International Conference, LATA 2009, Tarragona, Spain, April 28, 2009. Proceedings, edited by Adrian Horia Dediu, Armand Mihai Ionescu, Carlos MartinVide, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>