PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Maneth, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable.

, , and . J. ACM, 65 (4): 21:1-21:30 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sebastian Friedl University of Stuttgart

Communication extension for cloud-based machine control of simulated robot processes, , , and . 2016 IEEE International Conference on Industrial Technology (ICIT), page 54-58. (March 2016)

Sebastian Brandhofer University of Stuttgart

Sebastian Haunss

Dr. Sebastian Rojek University of Stuttgart

Sebastian Lippold University of Stuttgart

 

Other publications of authors with the same name

Fast in-memory XPath search using compressed indexes., , , , , , , and . Softw., Pract. Exper., 45 (3): 399-434 (2015)Equivalence - Combinatorics, Algebra, Proofs., , , and . Dependable Software Systems Engineering, volume 45 of NATO Science for Peace and Security Series - D: Information and Communication Security, IOS Press, (2016)Traversing Grammar-Compressed Trees with Constant Delay., , and . DCC, page 546-555. IEEE, (2016)Traversing Grammar-Compressed Trees with Constant Delay., , and . CoRR, (2015)Parameter Reduction in Grammar-Compressed Trees., , and . FoSSaCS, volume 5504 of Lecture Notes in Computer Science, page 212-226. Springer, (2009)Classes of Tree Homomorphisms with Decidable Preservation of Regularity., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 127-141. Springer, (2008)Static Garbage Collection.. CIAA, volume 11601 of Lecture Notes in Computer Science, page 3-9. Springer, (2019)Multi-Return Macro Tree Transducers., , and . CIAA, volume 5148 of Lecture Notes in Computer Science, page 102-111. Springer, (2008)Tree Languages Generated be Context-Free Graph Grammars., and . TAGT, volume 1764 of Lecture Notes in Computer Science, page 15-29. Springer, (1998)Largest Common Prefix of a Regular Tree Language., and . FCT, volume 11651 of Lecture Notes in Computer Science, page 95-108. Springer, (2019)