Developments in Language Theory C

41 papers

YearTitle / Authors
2006A Decision Procedure for Reflexive Regular Splicing Languages.
Paola Bonizzoni, Giancarlo Mauri
2006Adding Nesting Structure to Words.
Rajeev Alur, P. Madhusudan
2006Bag Context Tree Grammars.
Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt
2006Can Abstract State Machines Be Useful in Language Theory?.
Yuri Gurevich, Charles Wallace
2006Characterizing DNA Bond Shapes Using Trajectories.
Michael Domaratzki
2006Ciliate Bio-operations on Finite String Multisets.
Jürgen Dassow, György Vaszil
2006Closure of Language Classes Under Bounded Duplication.
Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
2006Complexity of Degenerated Three Dimensional Billiard Words.
Jean-Pierre Borel
2006Computational Nature of Biochemical Reactions.
Andrzej Ehrenfeucht, Grzegorz Rozenberg
2006Computing by Only Observing.
Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Hoogeboom
2006Context-Dependent Nondeterminism for Pushdown Automata.
Martin Kutrib, Andreas Malcher
2006Context-Free Grammars and XML Languages.
Alberto Bertoni, Christian Choffrut, Beatrice Palano
2006Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages.
Adrian-Horia Dediu, Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Benedek Nagy
2006Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings
Oscar H. Ibarra, Zhe Dang
2006End-Marked Maximal Depth-First Contextual Grammars.
Lakshmanan Kuppusamy
2006Equivalence of Functions Represented by Simple Context-Free Grammars with Output.
Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
2006Factorial Languages of Low Combinatorial Complexity.
Arseny M. Shur
2006Finding Lower Bounds for Nondeterministic State Complexity Is Hard.
Hermann Gruber, Markus Holzer
2006Hierarchies of Tree Series Transformations Revisited.
Andreas Maletti
2006Involution Solid and Join Codes.
Natasa Jonoska, Lila Kari, Kalpana Mahalingam
2006Language Equations with Complementation.
Alexander Okhotin, Oksana Yakimova
2006Languages in Membrane Computing: Some Details for Spiking Neural P Systems.
Gheorghe Paun
2006Lowering Undecidability Bounds for Decision Questions in Matrices.
Paul Bell, Igor Potapov
2006Noncanonical LALR(1) Parsing.
Sylvain Schmitz
2006On Critical Exponents in Fixed Points of Non-erasing Morphisms.
Dalia Krieger
2006On Some Variations of Two-Way Probabilistic Finite Automata Models.
Bala Ravikumar
2006On Weakly Ambiguous Finite Transducers.
Nicolae Santean, Sheng Yu
2006On the Gap-Complexity of Simple RL-Automata.
Frantisek Mráz, Friedrich Otto, Martin Plátek
2006P Systems with Proteins on Membranes and Membrane Division.
Andrei Paun, Bianca Popa
2006Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2006Polynomials, Fragments of Temporal Logic and the Variety DA over Traces.
Manfred Kufleitner
2006Prime Decompositions of Regular Languages.
Yo-Sub Han, Kai Salomaa, Derick Wood
2006Simulation Relations for Alternating Parity Automata and Parity Games.
Carsten Fritz, Thomas Wilke
2006Some Examples of Semi-rational DAG Languages.
Jan Robert Menzel, Lutz Priese, Monika Schuth
2006Synchronization of Pushdown Automata.
Didier Caucal
2006Synchronizing Automata with a Letter of Deficiency 2.
Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks
2006The Boolean Closure of Growing Context-Sensitive Languages.
Tomasz Jurdzinski
2006The Growth Ratio of Synchronous Rational Relations Is Unique.
Olivier Carton
2006Weighted Automata and Weighted Logics on Infinite Words.
Manfred Droste, George Rahonis
2006Well Quasi Orders and the Shuffle Closure of Finite Sets.
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006Well-Founded Semantics for Boolean Grammars.
Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis