Sciweavers

209 search results - page 20 / 42
» Regular Languages and Associative Language Descriptions
Sort
View
ICSE
2011
IEEE-ACM
13 years 5 days ago
Leveraging software architectures to guide and verify the development of sense/compute/control applications
A software architecture describes the structure of a computing system by specifying software components and their interactions. Mapping a software architecture to an implementatio...
Damien Cassou, Emilie Balland, Charles Consel, Jul...
IJAC
2008
84views more  IJAC 2008»
13 years 8 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
DOCENG
2003
ACM
14 years 2 months ago
Methods for the semantic analysis of document markup
We present an approach on how to investigate what kind of semantic information is regularly associated with the structural markup of scientific articles. This approach addresses ...
Petra Saskia Bayerl, Harald Lüngen, Daniela G...
WECWIS
1999
IEEE
162views ECommerce» more  WECWIS 1999»
14 years 1 months ago
A Conceptual Annotation Approach to Indexing in a Web-Based Information System
All the specialists have agreed that the possibility of adding to multimedia WWW objects some sort of `conceptual' annotations describing their information content would grea...
Elisa Bertino, Barbara Catania, Gian Piero Zarri
LATIN
1992
Springer
14 years 24 days ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin