Results 1  10
of
459,569
Decidability of conjugacy of treeshifts of finite type
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2009
"... A onesided (resp. twosided) shift of finite type of dimension one can be described as the set of infinite (resp. biinfinite) sequences of consecutive edges in a finitestate automaton. While the conjugacy of shifts of finite type is decidable for onesided shifts of finite type of dimension one ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
show that a conjugacy between two shifts of finite type can be broken down into a finite sequence of elementary transformations called insplittings and inamalgamations. We prove that the conjugacy problem is decidable for tree shifts of finite type. This result makes the class of tree shifts closer
Sofic Treeshifts
, 2010
"... We introduce the notion of sofic treeshifts which corresponds to symbolic dynamical systems of infinite ranked trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique reduced deterministic irreducible tree automaton accepting an irreducibl ..."
Abstract
 Add to MetaCart
an irreducible sofic treeshift, but that there is a unique synchronized one, called the Fischer automaton of the treeshift. We define the notion of almost of finite type treeshift which are sofic treeshifts accepted by a tree automaton which is both deterministic and codeterministic with a finite delay
Sofic and almost of finite type treeshifts
 IN CSR
, 2010
"... We introduce the notion of sofic treeshifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique minimal deterministic irreducible tree automaton accepting an irreducible sofi ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
sofic treeshift, but that there is a unique synchronized one, called the Shannon cover of the treeshift. We define the notion of almost finite type treeshift which is a meaningful intermediate dynamical class in between irreducible finite type treeshifts and irreducible sofic treeshifts. We
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 656 (35 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
A subordinated stochastic process model with finite variance for speculative prices
 Econometrica
, 1973
"... Thanks are due to Hendrik Houthakker and Christopher Sims, for both encouragement and advice in developing this paper. As usual, all remaining errors are my own. This research was supported by a Harvard Dissertation Fellowship, NSF grant 33708, and the ..."
Abstract

Cited by 548 (1 self)
 Add to MetaCart
Thanks are due to Hendrik Houthakker and Christopher Sims, for both encouragement and advice in developing this paper. As usual, all remaining errors are my own. This research was supported by a Harvard Dissertation Fellowship, NSF grant 33708, and the
On understanding types, data abstraction, and polymorphism
 ACM COMPUTING SURVEYS
, 1985
"... Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Objectoriented languag ..."
Abstract

Cited by 855 (13 self)
 Add to MetaCart
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 634 (25 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Mathematical Control Theory: Deterministic Finite Dimensional Systems
 of Texts in Applied Mathematics
, 1990
"... The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in contro ..."
Abstract

Cited by 486 (122 self)
 Add to MetaCart
The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in control theory, except — as the subtitle has warned us — those involving stochastic processes or infinitedimensional systems. The level is appropriate for a senior
Panel Cointegration; Asymptotic and Finite Sample Properties of Pooled Time Series Tests, With an Application to the PPP Hypothesis; New Results. Working paper
, 1997
"... We examine properties of residualbased tests for the null of no cointegration for dynamic panels in which both the shortrun dynamics and the longrun slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed ..."
Abstract

Cited by 499 (13 self)
 Add to MetaCart
We examine properties of residualbased tests for the null of no cointegration for dynamic panels in which both the shortrun dynamics and the longrun slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed effects and trend terms, and we consider both pooled within dimension tests and group mean between dimension tests+ We derive limiting distributions for these and show that they are normal and free of nuisance parameters+ We also provide Monte Carlo evidence to demonstrate their small sample size and power performance, and we illustrate their use in testing purchasing power parity for the post–Bretton Woods period+ 1.
Results 1  10
of
459,569