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