Titlebook: SOFSEM 2011: Theory and Practice of Computer Science; 37th Conference on C Ivana Černá,Tibor Gyimóthy,Stefan Wolf Conference proceedings 20

巧办法

One-Reversal Counter Machines and Multihead Automata: Revisited,ning results of these types, we use counting and “cut-and-paste” arguments as well as an interesting technique that shows that if a language were accepted by a device in a given class, then all recursively enumerable languages would be decidable.

inscribe

Conference proceedings 2011in Nový, Smokovec, Slovakia in January 2011.The 41 revised full papers, presented together with 5 invited contributions, were carefully reviewed and selected from 122 submissions. SOFSEM 2011 was organized around the following four tracks: foundations of computer science; software, systems, and serv

Customary

0302-9743 erence on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011, held in Nový, Smokovec, Slovakia in January 2011.The 41 revised full papers, presented together with 5 invited contributions, were carefully reviewed and selected from 122 submissions. SOFSEM 2011 was organized around

尖叫

MINT

A Structured Codesign Approach to Many-Core Architectures for Embedded Systems,r method is based on the combination of three technologies that are not commonly used in such a context: a.) programmable hardware, b.) high-level computing model and programming language, and c.) hybrid hardware/ software compilation. Resulting benefits are better reliability and performance, as we

阻止

SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information?,which possesses a binary description that allows its (slow) public simulation and prediction. Besides this public key like functionality, SIMPL systems have another advantage: No secret information is, or needs to be, contained in SIMPL systems in order to enable cryptographic protocols — neither in

溺爱

Verification of Timed-Arc Petri Nets,ransitions are labelled with time intervals restricting the age of tokens available for transition firing. The TAPN model posses a number of interesting theoretical properties distinguishing them from other time extensions of Petri nets. We shall give an overview of the recent theory developed in th

轮流

Efficient Algorithms for Handling Nondeterministic Automata,ten, deterministic automata are used for which traditional algorithms for important operations such as minimisation and inclusion checking are available. However, the use of deterministic automata implies a need to determinise nondeterministic automata that often arise during various computations ev

accrete

figure