| Description |
1 online resource (xv, 754 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 5457 |
|
LNCS sublibrary SL 1 Theoretical computer science and general issues |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
|
Lecture notes in computer science ; 5457.
|
| Contents |
Invited 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 |
| 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 |
| Bibliography |
Includes bibliographical references |
| Notes |
Print version record |
| Subject |
Formal languages -- Congresses
|
|
Artificial intelligence.
|
|
Programming languages (Electronic computers)
|
|
Artificial Intelligence
|
|
Programming Languages
|
|
artificial intelligence.
|
|
Informatique.
|
|
Programming languages (Electronic computers)
|
|
Artificial intelligence
|
|
Formal languages
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Horia Dediu, Adrian.
|
|
Mihai Ionescu, Armand.
|
|
Martín Vide, Carlos.
|
| ISBN |
9783642009822 |
|
3642009824 |
|
9783642009815 |
|
3642009816 |
|
