Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ESORICS
2012
Springer
9 years 9 months ago
Third-Party Private DFA Evaluation on Encrypted Files in the Cloud
Motivated by the need to outsource file storage to untrusted clouds while still permitting limited use of that data by third parties, we present practical protocols by which a cli...
Lei Wei 0004, Michael K. Reiter
CIE
2011
Springer
10 years 6 months ago
Automatic Learners with Feedback Queries
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukh...
UC
2010
Springer
11 years 4 months ago
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via p...
Genaro Juárez Martínez, Kenichi Mori...
TIT
2008
106views more  TIT 2008»
11 years 6 months ago
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
François Arnault, Thierry P. Berger, Marine...
TCS
2008
11 years 6 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
IJAC
2007
99views more  IJAC 2007»
11 years 6 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
JFP
2006
113views more  JFP 2006»
11 years 6 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
CORR
2007
Springer
113views Education» more  CORR 2007»
11 years 6 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
ENTCS
2008
100views more  ENTCS 2008»
11 years 6 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
AMAI
2006
Springer
11 years 6 months ago
Tableau-based automata construction for dynamic linear time temporal logic*
We present a tableau-based algorithm for obtaining a B
Laura Giordano, Alberto Martelli
books