FEEDBACK Smiley face
Normal view MARC view ISBD view

Developments in Language Theory [electronic resource] :14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings /

Contributor(s): Gao, Yuan [editor.] | Lu, Hanlin [editor.] | Seki, Shinnosuke [editor.] | Yu, Sheng [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 6224Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.Description: XII, 446 p. 48 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642144554.Subject(s): Computer science | Computer programming | Programming languages (Electronic computers) | Computers | Algorithms | Mathematical logic | Computer Science | Programming Techniques | Programming Languages, Compilers, Interpreters | Theory of Computation | Algorithm Analysis and Problem Complexity | Computation by Abstract Devices | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
Contents:
Invited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D’Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?erný-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?erný Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Invited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D’Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?erný-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?erný Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in