 |
|
|||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||
 |
||||||||||||||||||||||||||||||||||||
|
Veröffentlichungen / Publications2012Cyclic rewriting and conjugacy problemsVolker Diekert, Andrew Duncan, Alexei G. MyasnikovGroups Complexity Cryptology. 4(2) 2012.[arXiv:1206.4431] Logspace computations in graph groups and Coxeter groupsVolker Diekert, Jonathan Kausch, Markus LohreyProceedings of LATIN 2012 in Lecture Notes in Computer Science, Volume 7256, Pages 243-254, Springer-Verlag, 2012.[arXiv:1201.3174v1] [© Springer-Verlag] Logspace computations in Coxeter groups and graph groupsVolker Diekert, Jonathan Kausch, Markus LohreyComputational and Combinatorial Group Theory and Cryptography, volume 582 of Contemporary Mathematics, pages 77-94. Amer. Math. Soc., 2012.[arXiv:1201.3174v1] Language theoretical properties of hairpin formationsVolker Diekert, Steffen KopeckiTheoretical Computer Science, Volume 429, Pages 65-73, Elsevier, 2012.[© Elsevier] Deciding regularity of hairpin completions of regular languages in polynomial timeVolker Diekert, Steffen Kopecki, Victor MitranaInformation and Computation, Volume 217, Pages 12-30, Elsevier, 2012.[arXiv:11082427v1] [© ScienceDirect] 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] Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in PVolker Diekert, Jürn Laun, Alexander UshakovProceedings of the Symposium on Theoretical Aspects of Computer Science 2012 (STACS), 2012.[pdf File on LIPIcs] Context-Free Groups and Their Structure TreesVolker Diekert, Armin WeißPreprint, 2012.[arXiv:1202.3276v4] 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] Deciding Whether a Regular Language is Generated by a Splicing SystemLila Kari, Steffen KopeckiAccepted by DNA 18, 2012.[arXiv:1112.4897] Iterated Hairpin Completions of Non-crossing WordsLila Kari, Steffen Kopecki, Shinnosuke SekiIn M. Bioliková, G. Friedrich, G. Gottlob, S.Katyenbeisser, and G. Turán (editors), 38th Conference on Current Trends in Theorz and Practice of Computer Science, Volume 7147 of LNCS, Pages 337–348, 2011.[Springer] [arXiv:1110.0760] 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] Efficient Algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in PJürn LaunPreprint, 2012.[arXiv:1207.6944v2] |
|
Letzte Änderung 16. Apr 14:01 | © Universität Stuttgart | Impressum |