Ondřej Soukup simple matrix grammars, generative power, number of components Překladače a gramatiky The concept of simple matrix grammars was introduced and first studied in early seventies. All the achieved results were summarized in a few following studies and the simple matrix grammars start disappearing from the forefront.

Aug 09, 2010  Excel Questions; Using 'isnumber' in a macro; Become a Registered Member (free) to remove the ads that appear in thread area. Click here to reset your password. You MUST have a valid e-mail address so that you may receive the instructions to complete the reset. Real Statistics Excel Function. KSPROB ( x, n, tails, iter, h) = an approximate p-value for the KS test for the Dn value equal to x for a sample of size n and tails = 1 (one tail) or 2 (two tails, default) based on a linear interpolation (if h = FALSE) or harmonic interpolation (if h = TRUE, default) of the values in the Kolmogorov-Smirnov Table.

This work returns to them and aims to correct some generally accepted historical mistakes. In the following studies, the very first definition of simple matrix grammars has slightly evolved to the modern and currently generally accepted form, nevertheless, the validity of the former related results were not revised.

However, these modifications have significant influence on the simple matrix grammars. Despite the existing beliefs that the simple matrix grammars define an infinite hierarchy of languages depending on the number of their components, we show that two components are exactly enough strong and the addition of another component do not increase the generative power. Moreover, we prove that simple matrix grammars with two components are precisely as strong as matrix grammars.

Jakub Šoustar parsing, parallel, communicating, pushdown, automata Překladače a gramatiky In this paper we will look at use of parallel communicating pushdown automata systems (PCPA), that communicates their stacks on request, in parsing. We will present some issues that would accompany their use, and also present some possible ways to deal with those issues.

New implicit transition mapping for pushdown automata, that are used as a components of a PCPA, will be presented. This new property is aimed at dealing with the issues, that are caused by new requirements which a PCPA poses on pushdown automata.

Marek Milkovič Unpacking, Decompilation, Retargetable Decompiler, Reverse Engineering, Executable Files, Packing, Malware, Compression Překladače a gramatiky Executable file packing is a process used for compression or protection of these files. The behavior and intent of such packed executable files is difficult or even impossible to analyze. If we want to analyze the original code, we need to detect the used packer and unpack the executable file with a tool called unpacker. This paper describes the methods used for packing and unpacking of the executable files as well as the implementation of an easily and quickly extensible unpacker, which is going to be used in a decompiler developed by AVG Technologies. This unpacker provides the interface for plugins, which extend the set of supported packers.

Powerquest drive image 2002 free download. Drive Image 7 used.v2i image files, it's basically the same as Ghost 9 and those image formats are fully supported as well except the ones made with medium compression. But as Red says, the Ghost 15 recovery disk will have no problems with those image files. (but there is a workaround for that as well). I have done it myself.