Invited Lecture: AddingNesting Structure to Words
Manfred Kufleitner
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
Manfred
Droste and George Rahonis
Weighted Automata and Weighted Logics on
Infinite Words
Simulation Relations for Alternating Parity Automata
and Parity Games
Cedric Bastien, Jurek
Czyzowicz, Wojciech Fraczak, and
Wojciech
Rytter
Equivalence
of Functions
Represented by Simple Context-Free Grammars with Output
F. Mraz, F. Otto, and M. Platek
On the Gap-Complexity of Simple RL-Automata
Sylvain Schmitz
3:00-
3:30 Coffee break
Alberto Bertoni, Christian Choffrut, and Beatrice Palano
Context-Free Grammars and XML Languages
Didier Caucal
Synchronization of Pushdown Automata
Martin Kutrib and Andreas Malcher
Context-Dependent Nondeterminism for Pushdown Automata
Yo-Sub Han, Kai Salomaa, and Derick Wood
Prime Decompositions of Regular Languages
Nicolae Santean and Sheng Yu
On Weakly Ambiguous Finite Transducers
Invited Lecture: Computational Nature of Biochemical Reactions
Ciliate
Bio-Operations on Finite String Multisets
Michael Domaratzki
Characterizing DNA Bond Shapes Using Trajectories
Natasha Jonoska, Lila Kari, and Kalpana Mahalingam
Involution Solid and Join
Codes
12:00-1:30 Lunch
Well-Founded Semantics for Boolean Grammars
Masami Ito, Peter Leupold, and Kayoko Shikishima-Tsuji
Closure of Language Classes under Bounded Duplication
Tomasz Jurdzinski
The Boolean Closure of Growing Context-Sensitive Languages
Flavio
D'Alessandro, Gwenael Richomme, and Stefano Varricchio
Well Quasi Orders and the Shuffle Closure of
Finite Sets
Olivier Carton
The Growth Ratio of Synchronous Rational Relations is Unique
Dalia Krieger
On Critical Exponents in Fixed Points of Non-Erasing Morphisms
Wednesday, June 28
Invited Lecture: Languages in Membrane Computing; Some Details for Spiking Neural P Systems
P Systems with Proteins on Membranes and Membrane Division
M. Cavaliere, P. Frisco, and H.J. Hoogeboom
Paola Bonizzoni and Giancarlo Mauri
A Decision Procedure for Reflexive Regular Splicing Languages
12:00-1:30
Lunch
Invited Lecture: Can Abstract State Machines be Useful in Language Theory?
Contextual Hypergraph Grammars -- A New
Approach to the Generation of
Hypergraph Languages
Lutz Priese, Jan Robert Menzel, and Monika Schuth
Some Examples of Semi-Rational DAG LanguagesAlexander Okhotin and Oksana Yakimova
On Language Equations with Complementation
Finding Lower
Bounds for
Nondeterministic State Complexity
is Hard
Paul Bell and Igor Potapov
Lowering Undecidability Bounds for Decision Questions in Matrices
Jean-Pierre Borel
Complexity of Degenerated Three-Dimensional Billiard Words
Factorial
Languages of Low Combinatorial Complexity
Perfect Correspondences between Dot-Depth and Polynomial-Time Hierarchy
4:30-4:40
Break
D. S. Ananichev, M. V. Volkov, and Yu. I. Zaks
Synchronizing Automata with a Letter of Deficiency 2
Balasubramanian Ravikumar
On Some Variations of Two-Way Probabilistic Finite Automata
5:40-6:30
Closing and information concerning of DLT 2007