Sciweavers

423 search results - page 20 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 6 months ago
A Categorical Outlook on Cellular Automata
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
Silvio Capobianco, Tarmo Uustalu
IJFCS
2008
158views more  IJFCS 2008»
13 years 8 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
DKE
2006
139views more  DKE 2006»
13 years 8 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
FORMATS
2009
Springer
14 years 3 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
14 years 2 months ago
Biomolecular Implementation of Computing Devices with Unbounded Memory
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
Matteo Cavaliere, Natasa Jonoska, Sivan Yogev, Ron...