 |
|
|||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||
 |
||||||||||||||||||||||||||||||||||||
|
Kufleitner2013:Diskrete algebraische MethodenVolker Diekert, Manfred KufleitnerLehrbuch, Walter de Gruyter, 2013.[Webseite] Elemente der Diskreten MathematikVolker Diekert, Manfred KufleitnerLehrbuch, Walter de Gruyter, 2013.[Webseite] Positive Alternation in FO2 Over Finite WordsManfred Kufleitner, Alexander LauserSubmitted to Conference on Computer Science Logic 2013 (CSL 2013)Quantifier Alternation in Two-Variable First-Order Logic with Successor Is DecidableManfred Kufleitner, Alexander LauserTheoretical Aspects of Computer Science, International Symposium (STACS) 2013, Conference Proceedings, volume 20 of Leibniz International Proceedings in Informatics (LIPIcs), pages 305–316, Schloss Dagstuhl, 2013.[pdf] [http] 2012:Bounded synchronization delay in omega-rational expressionsVolker Diekert, Manfred KufleitnerComputer Science Symposium in Russia (CSR) 2012, Conference Proceedings, volume 7353 of Lecture Notes in Computer Science, pages 89–98, Springer, 2012.Regular Languages are Church-Rosser CongruentialVolker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias WalterAutomata, Languages, and Programming, Lecture Notes in Computer Science, Volume 7392, Pages 177-188, Springer-Verlag, 2012.[arXiv:1202.1148v1] [© Springer-Verlag] This contribution received the best paper award in track B. The Krohn-Rhodes Theorem and Local DivisorsVolker Diekert, Manfred Kufleitner, Benjamin SteinbergFundamenta Informaticae, Volume 116, Pages 65-77, IOS Press, 2012.[arXiv:1111.1585v1] [© IOS Press] Regular Ideal Languages and Their Boolean CombinationsFranz Jahn, Manfred Kufleitner, Alexander LauserImplementation and Application of Automata (CIAA) 2012, Conference Proceedings, volume 7381 of Lecture Notes in Computer Science, pages 205–216. Springer, 2012.[arXiv] [© Springer-Verlag] The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on WordsManfred Kufleitner, Alexander LauserDiscrete Mathematics & Theoretical Computer Science, 14(1):141-146, 2012.[arXiv] [pdf] [Artikel bei © Maison de l'Informatique et des Mathématiques Discrètes] Lattices of Logical Fragments over Words (Extended Abstract)Manfred Kufleitner, Alexander LauserAutomata, Languages and Programming, International Colloquium (ICALP) 2012, Conference Proceedings, volume 7392 of Lecture Notes in Computer Science, pages 275–286. Springer, 2012.[http] [arXiv] [© Springer-Verlag] Around Dot-Depth OneManfred Kufleitner, Alexander LauserInternational Journal of Foundations of Computer Science, Vol. 23(6), World Scientific, 2012[pdf] [http] [© World Scientific Publishing Company] The Join Levels of the Trotter-Weil Hierarchy are DecidableManfred Kufleitner, Alexander LauserMathematical Foundations of Computer Science, International Symposium (MFCS) 2012, Conference Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 603–614. Springer, 2012.[arXiv] [© Springer-Verlag] The FO2 alternation hierarchy is decidableManfred Kufleitner, Pascal WeilComputer Science Logic (CSL 2012), Conference Proceedings, volume 16 of Leibniz International Proceedings in Informatics (LIPIcs), pages 426–439, Schloss Dagstuhl, 2012.[pdf] [http] 2011:Fragments of First-Order Logic over Infinite WordsVolker Diekert, Manfred KufleitnerTheory of Computing Systems, Vol. 48(3), Springer-Verlag (2011)[arXiv] [http] [© Springer-Verlag] Star-Free Languages are Church-Rosser CongruentialVolker Diekert, Manfred Kufleitner, Pascal WeilPreprint, 2011.[arXiv:1111.4300v1] First-order Fragments with Successor over Infinite WordsJakub Kallas, Manfred Kufleitner, Alexander LauserTheoretical Aspects of Computer Science, International Symposium (STACS) 2011, Conference Proceedings, volume 9 of Leibniz International Proceedings in Informatics (LIPIcs), pages 356–367, Schloss Dagstuhl, 2011.[pdf] [http] Partially Ordered Two-way Büchi AutomataManfred Kufleitner, Alexander LauserInternational Journal of Foundations of Computer Science, Vol. 22(8), World Scientific, 2011[pdf] [http] [© World Scientific Publishing Company] Languages of Dot-depth One over Infinite WordsManfred Kufleitner, Alexander LauserIEEE Symposium on Logic in Computer Science (LICS) 2011, Conference Proceedings, pages 23–32. IEEE Computer Society, 2011.[arXiv] Around Dot-depth OneManfred Kufleitner, Alexander LauserTechnical Report No. 2011/03, Computer Science, University of Stuttgart.[http] [arXiv] Cantor Topologies for Finite WordsManfred Kufleitner, Alexander LauserTechnical Report No. 2011/02, Computer Science, University of Stuttgart.[http] [arXiv] 2010:Rankers over Infinite Words (Extended Abstract)Luc Dartois, Manfred Kufleitner, Alexander LauserDevelopments in Language Theory (DLT) 2010, Conference Proceedings, volume 6224 of Lecture Notes in Computer Science, pages 148–159. Springer, 2010.[pdf] [http] [© Springer-Verlag] Rankers over Infinite WordsLuc Dartois, Manfred Kufleitner, Alexander LauserTechnical Report No. 2010/01, Computer Science, Universität Stuttgart.[http] [arXiv] First-Order Fragments with Successor over Infinite WordsJakub Kallas, Manfred Kufleitner, Alexander LauserTechnical Report No. 2010/08, Computer Science, Universität Stuttgart.[http] [arXiv] Partially Ordered Two-way Büchi AutomataManfred Kufleitner, Alexander LauserImplementation and Application of Automata (CIAA) 2010, Conference Proceedings, volume 6482 of Lecture Notes in Computer Science, pages 181–190. Springer, 2010.[pdf] [http] [© Springer-Verlag] Partially Ordered Two-way Büchi AutomataManfred Kufleitner, Alexander LauserTechnical Report No. 2010/03, Computer Science, Universität Stuttgart.[http] [arXiv] On the lattice of sub-pseudovarieties of DAManfred Kufleitner and Pascal WeilSemigroup Forum, 81(2):243-254, 2010.2009:Classification tree sourcesEdgar Binder and Manfred KufleitnerIn IEEE Information Theory Workshop 2009, ITW 2009, Taormina, Sicily, October 11-16, 2009, Proceedings. IEEE, 2009.Combining models in data compressionManfred Kufleitner, Edgar Binder, Alexander FriesIn Tjalling Tjalkens and Frans Willems, editors, Proceedings of the 30th Symposium on Information Theory in the Benelux, Eindhoven, The Netherlands, May 28-29, 2009, pages 135-142, 2009.Fragments of First-Order Logic over Infinite Words (Extended Abstract)Volker Diekert, Manfred KufleitnerIn Susanne Albers and Jean-Yves Marion, editors, 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, February 26-28, 2009, Proceedings, pages 325-336. pdf File (full version).Fragments of First-Order Logic over Infinite WordsVolker Diekert, Manfred KufleitnerTechnical Report No. 2009/04, Computer Science, Universität Stuttgart.http and arXiv:0906:2995 [cs.FL]. On smoothed analysis of quicksort and Hoare's findMahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini JahromiIn Hung Quang Ngo, editor, 15th International Computing and Combinatorics Conference (COCOON 2009), Niagara Falls, New York, U.S.A., July 13-15, 2009, Proceedings, volume 5609 of Lecture Notes in Computer Science, pages 158-167. Springer-Verlag, 2009.On bijective variants of the Burrows-Wheeler transformManfred KufleitnerIn Jan Holub and Jan Zdarek, editors, The Prague Stringology Conference 2009, PSC 2009, Prague, Czech Republic, August 31-September 2, 2009, Proceedings, pages 65-79, 2009.On FO2 quantifier alternation over wordsManfred Kufleitner, Pascal WeilIn Rastislav Kralovic and Damian Niwinski, editors, Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Nový Smokovec, Slovakia, August 24-28, 2009, Proceedings, volume 5734 of Lecture Notes in Computer Science, pages 513-524. Springer-Verlag, 2009.2008:A Survey on Small Fragments of First-Order Logic over Finite WordsVolker Diekert, Paul Gastin, Manfred KufleitnerInternational Journal of Foundations of Computer Science, 19(3): 513-548, 2008. pdf File (© World Scientific).The height of factorization forestsManfred KufleitnerIn Edward Ochmanski and Jerzy Tyszkiewicz, editors, Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 443-454. Springer-Verlag, 2008.2007:On first-order fragments for Mazurkiewicz tracesVolker Diekert, Martin Horsch, Manfred KufleitnerFundamenta Informaticae, 80(1-3):1-29, 2007. pdf File (© IOS Press).On first-order fragments for words and Mazurkiewicz traces: A surveyVolker Diekert, Manfred KufleitnerDLT 2007. In Tero Harju, Juhani Karhumäki, and Arto Lepistö, editors, Proceedings Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Lecture Notes in Computer Science, Vol 4588 (2007) 1-19. pdf File (© Springer-Verlag).Polynomials, fragments of temporal logic and the variety DA over tracesManfred KufleitnerTheoretical Computer Science, 376:89-100, 2007. Special issue DLT 2006.A Proof of the Factorization Forest TheoremManfred KufleitnerTechnical report Nr. 2007/05, Formale Methoden der Informatik, Universität Stuttgart, Germany, 4 pages, October 2007. pdf File2006:Polynomials, fragments of temporal logic and the variety DA over tracesManfred KufleitnerIn Oscar H. Ibarra and Zhe Dang, editors, Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, volume 4036 of Lecture Notes in Computer Science, pages 37-48. Springer-Verlag, 2006.2003:A Remark about Quadratic Trace EquationsVolker Diekert, Manfred KufleitnerDLT 2002, 59-66, LNCS 2450, 2003. ps File (© Springer-Verlag). |
|
Letzte Änderung 16. Apr 14:01 | © Universität Stuttgart | Impressum |