Security protocols flaws represent a substantial portion of security exposures of data networks. In order to evaluate security protocols against any attack, formal methods are equipped with a number of techniques. Unfortunately, formal methods are applicable for static state only, and don’t guarantee detecting all possible flaws. Therefore, formal methods should be complemented with dynamic pro...

Using a level oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model data-path circuits. On the other hand, in order to use such a model for larger circuit, some technique to avoid the state explosion problem is essential. This paper first defines a level oriented formal model based on time Petri nets, a...

The commonsensical assumption that any language has only finitely many words is shown to be false by a combination of formal and empirical arguments. Zipf's Law and related formulas are investigated and a more complex model is offered.

We give a survey of recent works relating algebraic languages and formal power series with the enumeration of polyominoes (and animals). More precisely, encoding these structures with words yields new exact results.

Introduction As both Hiragana and Katakana are syllabic scripts, their characters are usually not suitable for representing the precise pronunciation of foreign words, particularly which have any consonant cluster or closed syllable. However in some special areas, there are extended kana characters to represent the pronunciation of such words more precisely. This report, as an example, picks up...

In acquiring number words, children exhibit a qualitative leap in which they transition from understanding the first several number words, to possessing a recursive system of interrelated numerical concepts. We provide a formal learning model that explains how this transition and several related developmental patterns can result from a single inductive learning mechanism. The model provides a B...

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. We investigate one-dimensional fragment over words and over ω-words. We show that it is expressively equivalent to the twovariable fragment of first-order logic. We also show that its satisfiability problem is NExpTimecomplete. Furthe...

– from a linguistic perspective – from a formal perspective • Locality of grammatical relations in HPSG 3 HPSG grammars from a linguistic perspective From a linguistic perspective, an HPSG grammar consists of • a lexicon licensing basic words • lexical rules licensing derived words • immediate dominance (id) schemata licensing constituent structure • linear precedence (lp) statements constraini...

We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost f...