423 search results - page 20 / 85 » The Generalization of Generalized Automata: Expression Autom... |
134
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
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...
160
click to vote
IJFCS
2008
15 years 4 months ago
2008
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 ...
190
click to vote
DKE
2006
15 years 4 months ago
2006
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...
127
click to vote
FORMATS
2009
Springer
15 years 11 months ago
2009
Springer
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...
157
click to vote
DNA
2004
Springer
15 years 9 months ago
2004
Springer
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...