10. DLT 2006:
Santa Barbara, CA, USA
Oscar H. Ibarra, Zhe Dang (Eds.):
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings.
Lecture Notes in Computer Science 4036 Springer 2006, ISBN 3-540-35428-X 
Invited Lectures
Papers
- Manfred Kufleitner:
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces.
37-48
- Manfred Droste, George Rahonis:
Weighted Automata and Weighted Logics on Infinite Words.
49-58
- Carsten Fritz, Thomas Wilke:
Simulation Relations for Alternating Parity Automata and Parity Games.
59-70
- Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Equivalence of Functions Represented by Simple Context-Free Grammars with Output.
71-82
- Frantisek Mráz, Friedrich Otto, Martin Plátek:
On the Gap-Complexity of Simple RL-Automata.
83-94
- Sylvain Schmitz:
Noncanonical LALR(1) Parsing.
95-107
- Alberto Bertoni, Christian Choffrut, Beatrice Palano:
Context-Free Grammars and XML Languages.
108-119
- Didier Caucal:
Synchronization of Pushdown Automata.
120-132
- Martin Kutrib, Andreas Malcher:
Context-Dependent Nondeterminism for Pushdown Automata.
133-144
- Yo-Sub Han, Kai Salomaa, Derick Wood:
Prime Decompositions of Regular Languages.
145-155
- Nicolae Santean, Sheng Yu:
On Weakly Ambiguous Finite Transducers.
156-167
- Jürgen Dassow, György Vaszil:
Ciliate Bio-operations on Finite String Multisets.
168-179
- Michael Domaratzki:
Characterizing DNA Bond Shapes Using Trajectories.
180-191
- Natasa Jonoska, Lila Kari, Kalpana Mahalingam:
Involution Solid and Join Codes.
192-202
- Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-Founded Semantics for Boolean Grammars.
203-214
- Andreas Maletti:
Hierarchies of Tree Series Transformations Revisited.
215-225
- Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt:
Bag Context Tree Grammars.
226-237
- Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji:
Closure of Language Classes Under Bounded Duplication.
238-247
- Tomasz Jurdzinski:
The Boolean Closure of Growing Context-Sensitive Languages.
248-259
- Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well Quasi Orders and the Shuffle Closure of Finite Sets.
260-269
- Olivier Carton:
The Growth Ratio of Synchronous Rational Relations Is Unique.
270-279
- Dalia Krieger:
On Critical Exponents in Fixed Points of Non-erasing Morphisms.
280-291
- Andrei Paun, Bianca Popa:
P Systems with Proteins on Membranes and Membrane Division.
292-303
- Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Hoogeboom:
Computing by Only Observing.
304-314
- Paola Bonizzoni, Giancarlo Mauri:
A Decision Procedure for Reflexive Regular Splicing Languages.
315-326
- Adrian Horia Dediu, Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Benedek Nagy:
Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages.
327-338
- K. Lakshmanan:
End-Marked Maximal Depth-First Contextual Grammars.
339-350
- Jan Robert Menzel, Lutz Priese, Monika Schuth:
Some Examples of Semi-rational DAG Languages.
351-362
- Hermann Gruber, Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity Is Hard.
363-374
- Paul Bell, Igor Potapov:
Lowering Undecidability Bounds for Decision Questions in Matrices.
375-385
- Jean-Pierre Borel:
Complexity of Degenerated Three Dimensional Billiard Words.
386-396
- Arseny M. Shur:
Factorial Languages of Low Combinatorial Complexity.
397-407
- Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
408-419
- Alexander Okhotin, Oksana Yakimova:
Language Equations with Complementation.
420-432
- Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks:
Synchronizing Automata with a Letter of Deficiency 2.
433-442
- Bala Ravikumar:
On Some Variations of Two-Way Probabilistic Finite Automata Models.
443-454
Last update Sat May 25 02:44:21 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
