Results 261 to 270 of about 3,241,555 (307)
Non-Self-Embedding Grammars and Descriptional Complexity
Fundamenta Informaticae, 2021 Non-self-embedding grammars are a subclass of context-free grammars which only generate regular languages. The size costs of the conversion of non-self-embedding grammars into equivalent finite automata are studied, by proving optimal bounds for the number of states of nondeterministic and deterministic automata equivalent to given non-self-embedding ...
Giovanni Pighizzini, Luca Prigioniero
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The undecidability of self-embedding for term rewriting systems
Information Processing Letters, 1985The self-embedding property of term rewriting systems is closely related to the uniform termination property, since a nonself-embedding term rewriting system is uniform terminating. The self-embedding property is shown to be undecidable and partially decidable. It follows that the nonself-embedding property is not partially decidable. This is true even
David A Plaisted
exaly +3 more sources
Reference Sharing Mechanism for Watermark Self-Embedding
IEEE Transactions on Image Processing, 2011This paper proposes two novel self-embedding watermarking schemes based upon a reference sharing mechanism, in which the watermark to be embedded is a reference derived from the original principal content in different regions and shared by these regions for content restoration. After identifying tampered blocks, both the reference data and the original
Xinpeng Zhang +2 more
exaly +3 more sources
Efficient Method for Content Reconstruction With Self-Embedding
IEEE Transactions on Image Processing, 2013This paper presents a new model of the content reconstruction problem in self-embedding systems, based on an erasure communication channel. We explain why such a model is a good fit for this problem, and how it can be practically implemented with the use of digital fountain codes. The proposed method is based on an alternative approach to spreading the
Paweł Korus, Andrzej Dziech
exaly +3 more sources
Encoding Self-Embedded Sentences
Language and Speech, 1976Are encoding and decoding mirror image processes? Previous studies show that semantically supported self-embedded sentences are easier to decode than semantically neutral sentences. A procedure for testing encoding is developed. The hypothesis that semantically supported self-embedded sentences are not easier to encode than semantically neutral ...
openaire +2 more sources
Canadian Mathematical Bulletin, 1989
AbstractElementary proofs are given of the following two statements: (1) Every infinite tree of height at most ω properly embeds into itself. (2) There is a tree of height ω + 1 that does not properly embed into itself.
openaire +1 more source
AbstractElementary proofs are given of the following two statements: (1) Every infinite tree of height at most ω properly embeds into itself. (2) There is a tree of height ω + 1 that does not properly embed into itself.
openaire +1 more source
Self-embedding watermark with flexible restoration quality
Multimedia Tools and Applications, 2010A novel self-embedding watermarking scheme is proposed, in which the reference data derived from the most significant bits (MSB) of host image and the localization data derived from MSB and reference data are embedded into the least significant bits (LSB) of the cover.
Xinpeng Zhang 0001 +3 more
openaire +1 more source