Developments in Language Theory C

39 papers

YearTitle / Authors
20072-Visibly Pushdown Automata.
Dario Carotenuto, Aniello Murano, Adriano Peron
2007A Local Balance Property of Episturmian Words.
Gwénaël Richomme
2007A Star Operation for Star-Free Trace Languages.
Edward Ochmanski, Krystyna Stawikowska
2007An Efficient Computation of the Equation
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
2007An Extension of Newton's Method to
Javier Esparza, Stefan Kiefer, Michael Luttenberger
2007Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.
Alberto Bertoni, Roberto Radicioni
2007Avoiding Approximate Squares.
Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2007Bisimulation Minimisation for Weighted Tree Automata.
Johanna Högberg, Andreas Maletti, Jonathan May
2007Characterizing Reduction Graphs for Gene Assembly in Ciliates.
Robert Brijder, Hendrik Jan Hoogeboom
2007Coding Partitions: Regularity, Maximality and Global Ambiguity.
Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
2007Commutation of Binary Factorial Languages.
Anna E. Frid
2007Complexity Theory for Splicing Systems.
Remco Loos, Mitsunori Ogihara
2007Conjunctive Grammars Can Generate Non-regular Unary Languages.
Artur Jez
2007Definable Transductions and Weighted Logics for Texts.
Christian Mathissen
2007Descriptional Complexity of Bounded Context-Free Languages.
Andreas Malcher, Giovanni Pighizzini
2007Descriptional Complexity of Nondeterministic Finite Automata.
Kai Salomaa
2007Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.
Jozef Jirásek, Galina Jirásková, Alexander Szabari
2007Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
Tero Harju, Juhani Karhumäki, Arto Lepistö
2007Duplication Roots.
Peter Leupold
2007Fine Hierarchy of Regular Aperiodic
Victor L. Selivanov
2007Finite Automata and the Writing of Numbers.
Jacques Sakarovitch
2007Finite Automata on Unranked and Unordered DAGs.
Lutz Priese
2007From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.
Marcella Anselmo, Dora Giammarresi, Maria Madonia
2007Hairpin Finite Automata.
Henning Bordihn, Markus Holzer, Martin Kutrib
2007Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP.
Hermann Gruber, Markus Holzer
2007Information Distance and Applications.
Ming Li
2007Multi-letter Reversible and Quantum Finite Automata.
Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs
2007Non-constructive Methods for Finite Probabilistic Automata.
Rusins Freivalds
2007On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases.
Yuri Pritykin
2007On First-Order Fragments for Words and Mazurkiewicz Traces.
Volker Diekert, Manfred Kufleitner
2007On Transition Minimality of Bideterministic Automata.
Hellis Tamm
2007Quantitative Generalizations of Languages.
Thomas A. Henzinger
2007Reduced Languages as
Sandrine Julia, Tran Vinh Duc
2007State Complexity of Union and Intersection of Finite Languages.
Yo-Sub Han, Kai Salomaa
2007Suffix Automata and Standard Sturmian Words.
Marinella Sciortino, Luca Q. Zamboni
2007The Dynamics of Cellular Automata in Shift-Invariant Topologies.
Laurent Bienvenu, Mathieu Sablik
2007The Unambiguity of Segmented Morphisms.
Dominik D. Freydenberger, Daniel Reidenbach
2007Two Element Unavoidable Sets of Partial Words.
Francine Blanchet-Sadri, N. C. Brownstein, Justin Palumbo
2007What Do We Know About Language Equations?
Michal Kunc