LATA
2009
Springer
13 years 9 months ago
2009
Springer
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
LATA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
LATA
2009
Springer
13 years 9 months ago
2009
Springer
LATA
2009
Springer
13 years 11 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on hypothesis space chosen. We also discuss results which co...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Creole is a new born language emerging in most cases where language contact takes place. Simulating behaviors that creole communities are formed in some environments, we could cont...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...