Search

Your search keyword '"SCHNEIDER, JOHANNES C."' showing total 16 results
Start Over Author "SCHNEIDER, JOHANNES C."
16 results on '"SCHNEIDER, JOHANNES C."'

2. Periodicity Forcing Words

Author

Day, Joel D., Reidenbach, Daniel, Schneider, Johannes C., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Karhumäki, Juhani, editor, Lepistö, Arto, editor, and Zamboni, Luca, editor

Published
2013
Full Text
View/download PDF

3. On the Dual Post Correspondence Problem

Author

Day, Joel D., Reidenbach, Daniel, Schneider, Johannes C., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Béal, Marie-Pierre, editor, and Carton, Olivier, editor

Published
2013
Full Text
View/download PDF

4. Restricted Ambiguity of Erasing Morphisms

Author

Reidenbach, Daniel, Schneider, Johannes C., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gao, Yuan, editor, Lu, Hanlin, editor, Seki, Shinnosuke, editor, and Yu, Sheng, editor

Published
2010
Full Text
View/download PDF

5. Unambiguous Erasing Morphisms in Free Monoids

Author

Schneider, Johannes C., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Nielsen, Mogens, editor, Kučera, Antonín, editor, Miltersen, Peter Bro, editor, Palamidessi, Catuscia, editor, Tůma, Petr, editor, and Valencia, Frank, editor

Published
2009
Full Text
View/download PDF

6. Unambiguous Morphic Images of Strings

Author

Freydenberger, Dominik D., Reidenbach, Daniel, Schneider, Johannes C., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, De Felice, Clelia, editor, and Restivo, Antonio, editor

Published
2005
Full Text
View/download PDF

15. Unambiguous Morphic Images of Strings.

Author

Felice, Clelia, Restivo, Antonio, Freydenberger, Dominik D., Reidenbach, Daniel, and Schneider, Johannes C.

Abstract

Motivated by the research on pattern languages, we study a fundamental combinatorial question on morphisms in free semigroups: With regard to any string α over some alphabet we ask for the existence of a morphism σ such that σ(α) is unambiguous, i.e. there is no morphism ρ with $\rho \not= \sigma$ and ρ(α) = σ(α). Our main result shows that a rich and natural class of strings is provided with unambiguous morphic images. [ABSTRACT FROM AUTHOR]

Published
2005
Full Text
View/download PDF

16. Unambiguous erasing morphisms in free monoids

Author

Schneider, Johannes C.

Abstract

This paper discusses the fundamental combinatorial question of whether or not, for a given string α, there exists a morphism σsuch that σis unambiguous with respect to α, i.e.there exists no other morphism τsatisfying τ(α) = σ(α). While Freydenberger et al.[Int. J. Found. Comput. Sci.17(2006) 601–628] characterise those strings for which there exists an unambiguous nonerasingmorphism σ, little is known about the unambiguity of erasingmorphisms, i.e.morphisms that map symbols onto the empty string. The present paper demonstrates that, in contrast to the main result by Freydenberger et al., the existence of an unambiguous erasing morphism for a given string can essentially depend on the size of the target alphabet of the morphism. In addition to this, those strings for which there exists an erasing morphism over an infinite target alphabet are characterised, complexity issues are discussed and some sufficient conditions for the (non-)existence of unambiguous erasing morphisms are given.

Published
2010
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results