Developments in Language Theory C

43 papers

YearTitle / Authors
2008A Taxonomy of Deterministic Forgetting Automata.
Jens Glöckler
2008Algorithmically Independent Sequences.
Cristian S. Calude, Marius Zimand
2008An Analysis and a Reproof of Hmelevskii's Theorem.
Juhani Karhumäki, Aleksi Saarela
2008Bad News on Decision Problems for Patterns.
Dominik D. Freydenberger, Daniel Reidenbach
2008Balance Properties and Distribution of Squares in Circular Words.
Roberto Mantaci, Sabrina Mantaci, Antonio Restivo
2008Bounds on Powers in Strings.
Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera
2008Complexity of Topological Properties of Regular omega-Languages.
Victor L. Selivanov, Klaus W. Wagner
2008Construction of Tree Automata from Regular Expressions.
Dietrich Kuske, Ingmar Meinecke
2008Decidable Properties of 2D Cellular Automata.
Alberto Dennunzio, Enrico Formenti
2008Derivation Tree Analysis for Accelerated Fixed-Point Computation.
Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
Masami Ito, Masafumi Toyama
2008Duplication in DNA Sequences.
Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki
2008Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
2008Extended Multi Bottom-Up Tree Transducers.
Joost Engelfriet, Eric Lilin, Andreas Maletti
2008Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.
Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit
2008Fixed Point and Aperiodic Tilings.
Bruno Durand, Andrei Romashchenko, Alexander Shen
2008General Algorithms for Testing the Ambiguity of Finite Automata.
Cyril Allauzen, Mehryar Mohri, Ashish Rastogi
2008Hierarchies of Piecewise Testable Languages.
Ondrej Klíma, Libor Polák
2008Iteration Semirings.
Zoltán Ésik
2008Large Simple Binary Equality Words.
Jana Hadravová, Stepan Holub
2008MSO Logic for Unambiguous Shared-Memory Systems.
Rémi Morin
2008More Concise Representation of Regular Languages by Automata and Regular Expressions.
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2008On a Generalization of Standard Episturmian Morphisms.
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca
2008On the Computational Capacity of Parallel Communicating Finite Automata.
Henning Bordihn, Martin Kutrib, Andreas Malcher
2008On the Decidability of the Equivalence for k-Valued Transducers.
Rodrigo de Souza
2008On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes.
Juraj Hromkovic, Georg Schnitger
2008On the Non-deterministic Communication Complexity of Regular Languages.
Anil Ada
2008On the Relation between Periodicity and Unbordered Factors of Finite Words.
Stepan Holub, Dirk Nowotka
2008On the Size Complexity of Rotating and Sweeping Automata.
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2008On the State Complexity of Complements, Stars, and Reversals of Regular Languages.
Galina Jirásková
2008On the State Complexity of Operations on Two-Way Finite Automata.
Galina Jirásková, Alexander Okhotin
2008Provably Shorter Regular Expressions from Deterministic Finite Automata.
Hermann Gruber, Markus Holzer
2008Relationally Periodic Sequences and Subword Complexity.
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni
2008Selected Ideas Used for Decidability and Undecidability of Bisimilarity.
Petr Jancar
2008Some New Modes of Competence-Based Derivations in CD Grammar Systems.
Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil
2008The Average State Complexity of the Star of a Finite Set of Words Is Linear.
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
2008The Frobenius Problem and Its Generalizations.
Jeffrey O. Shallit
2008The Synchronization Problem for Strongly Transitive Automata.
Arturo Carpi, Flavio D'Alessandro
2008Tree Automata with Global Constraints.
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2008Universal Recursively Enumerable Sets of Strings.
Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan
2008Various Aspects of Finite Quantum Automata.
Mika Hirvensalo
2008Well Quasi-orders in Formal Language Theory.
Flavio D'Alessandro, Stefano Varricchio
2008When Is Reachability Intrinsically Decidable?.
Barbara F. Csima, Bakhadyr Khoussainov