MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Characterizations of Regularity." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

408 documents found, showing 1 through 10. Next 10 →

ATOM

Extremal Characterization Of Regular Wavelet Matrices And An Algorithm For Their Evaluation.
by Jaroslav Kautsky — 1993 — School. University of West Bohemia, Czech Rep
…EXTREMAL CHARACTERIZATION OF REGULAR WAVELET MATRICES AND AN ALGORITHM FOR THEIR EVALUATION…
Cited by 1 (1 self) – Add To MetaCart

Using a Self-tuning Adaptive Predictor to Characterize the Regularity of Memory Accesses in Pointer
by Keqiang Wu, Resit Sendag, David Lilja
…Using a Self-tuning Adaptive Predictor to Characterize the Regularity of Memory Accesses…
Cited by 1 (1 self) – Add To MetaCart

Symbolic Alternative Characterizations of Testing Preorders for Regular Timed Processes
by Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki — 1996 — University
…Symbolic Alternative Characterizations of Testing Preorders for Regular Timed Processes Shoji Yuen…
Cited by 1 (0 self) – Add To MetaCart

Affine processes and applications in finance
by D. Duffie, D. Filipović, W. Schachermayer — 2003 — Annals of Applied Probability
…. We provide the definition and a complete characterization of regular affine processes. This type…
Cited by 7 (1 self) – Add To MetaCart

Some Properties of Context-Free Languages Related to Primitive Words
by Peter Leupold — 2003 — PROCEEDINGS OF WORDS'03, TUCS GENERAL PUBLICATIONS
…. In this line of investigations we characterize the regular and context-free ones among these languages. Then we…
Cited by 2 (2 self) – Add To MetaCart

Deterministic Weak-and-Marked Petri Net Languages are Regular
by Stéphane Gaubert, Inria Roquencourt, Alessandro Giua — 1996 — IEEE Trans. on Automatic Control
…. We prove this result using a lemma that characterizes regular deterministic Petri net languages…
Add To MetaCart

Aggregation with Strong Regularities and Alternatives
by Helmut Horacek — 2002
… with 'and'. In contrast to that, solutions to logical problems are characterized by regularly occurring…
Add To MetaCart

Local Normal Forms for First-Order Logic with Applications to Games and Automata
by Thomas Schwentick, Klaus Barthelmann — 1999 — Discrete Mathematics and Theoretical Computer Science
… characterization of the regular string languages as the sets of models of (existential) monadic second-order (MSO…
Cited by 9 (1 self) – Add To MetaCart

J.L.: Discrete circles: an arithmetical approach with non- constant thickness
by C. Fiorio, D. Jamet, J. -l. Toutant — Vision Geometry XIV, Electronic Imaging, SPIE. Volume 6066., San Jose (CA), USA, SPIE (2006) 0C–1–0C–12
… hand, it results in the characterization of regular discrete circles with integer parameters as well…
Cited by 1 (1 self) – Add To MetaCart

Regular tree languages definable in FO and FOmod
by Michael Benedikt, Luc Segoufin — 2005 — In Proc. STACS’05, volume 3404 of Springer LNCS
… consider regular languages of labeled trees. We give an effective characterization of the regular languages…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB