A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Cardinality and counting quantifiers on omega-automatic structures

2008
*
Symposium on Theoretical Aspects of Computer Science
*

We investigate

doi:10.4230/lipics.stacs.2008.1360
dblp:conf/stacs/KaiserRB08
fatcat:agsicc6vevdtphqnds67suinj4
*structures*that can be represented by*omega*-automata, so called*omega*-*automatic**structures*,*and*prove that relations defined over such*structures*in*first*-*order*logic expanded by the*first*-*order*... This also complements a very recent result*of*Hjörth, Khoussainov, Montalban*and*Nies showing that there is an*omega*-*automatic**structure*which has no injective presentation. ... Acknowledgment We thank the referees for detailed technical remarks*and*corrections. ...##
###
Cardinality and counting quantifiers on omega-automatic structures
[article]

2008
*
arXiv
*
pre-print

We investigate

arXiv:0802.2866v1
fatcat:e6u444zcmzhepp56valkfilvqm
*structures*that can be represented by*omega*-automata, so called*omega*-*automatic**structures*,*and*prove that relations defined over such*structures*in*first*-*order*logic expanded by the*first*-*order*... This also complements a very recent result*of*Hjörth, Khoussainov, Montalban*and*Nies showing that there is an*omega*-*automatic**structure*which has no injective presentation. ... Acknowledgment We thank the referees for detailed technical remarks*and*corrections. ...##
###
On Decidability Properties of One-Dimensional Cellular Automata
[article]

2009
*
arXiv
*
pre-print

Then, applying recent results

arXiv:0903.4615v2
fatcat:fc5ccknkefdildt3lk7whl5xfi
*of*Kuske*and*Lohrey on*omega*-*automatic**structures*, it follows that the*first*-*order**theory*, extended with some*counting**and*cardinality quantifiers,*of*the*structure*S_A, is ... We*first*show that, for each one-dimensional cellular automaton A, the phase-space S_A is an*omega*-*automatic**structure*. ... We hope that the interplay*of*the two domains*of*cellular automata*and**of**automatic**structures*will be fruitful*and*will provide new results in both fields*of*research. ...##
###
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361)

2018
*
Dagstuhl Reports
*

This report documents the program

doi:10.4230/dagrep.7.9.1
dblp:journals/dagstuhl-reports/DawarGKS17
fatcat:teyilwvdgrd6tch2gdb4d4dd5m
*and*the outcomes*of*Dagstuhl Seminar 17361 "Finite*and*Algorithmic Model*Theory*". ... We formalize agent-based models as stochastic processes whose states are metafinite models,*and*we define a notion*of*abstraction. ... Our main results are conditions that imply an abstraction is sound,*and*further conditions that imply it preserves the Markov property. ...##
###
Page 3624 of Mathematical Reviews Vol. , Issue 89G
[page]

1989
*
Mathematical Reviews
*

Polymorphic lambda calculus has four sorts

*of*objects, called*orders*, operators, types*and*terms. The types make up an*order*called*Omega*. ... One may regard G as a contravari- ant functor from S to the category*of*small categories, functors*and*natural transformations, effectively giving a categorical*structure*externally to the object*Omega*...##
###
Function composition and automatic average case analysis

1995
*
Discrete Mathematics
*

We define the composition

doi:10.1016/0012-365x(94)00146-a
fatcat:ear4qr6blrffxbbokmitb5c67m
*of*functions defined over extended context-free languages. We show that this composition is*automatically*computable. ... It enables the*automatic*analysis*of*complex problems with small input descriptions, for example repeated differentiation or iterated automata on regular languages. ... all data*structures*are lists, or explicitly like in Lambda-Upsilon-*Omega*. ...##
###
Statistical study of auroral omega bands

2017
*
Annales Geophysicae
*

</strong> The presence

doi:10.5194/angeo-35-1069-2017
fatcat:bthv3qcwnvh63hjrtjmas2ewf4
*of*very few statistical studies on auroral*omega*bands motivated us to test-use a semi-*automatic*method for identifying large-scale undulations*of*the diffuse aurora boundary*and*... These findings support the*theory*that*omegas*are produced by fast earthward flows*and*auroral streamers, despite the rarity*of*good conjugate observations.</p> ... The authors thank Sanna Mäkinen, Jyrki Mattanen, Anneli Ketola, Tero Raita*and*Carl-Fredrik Enell for careful maintenance*of*the camera network*and*data flow,*and*Mikko Syrjäsuo for implementing the random ...##
###
Interlingual Annotation for MT Development
[chapter]

2004
*
Lecture Notes in Computer Science
*

In this paper, we describe the creation

doi:10.1007/978-3-540-30194-3_26
fatcat:67rre7wl4fernonqeu2x44nhgu
*of*an interlingua*and*the development*of*a corpus*of*semantically annotated text, to be validated in six languages*and*evaluated in several ways. ... We present the annotation tools built*and*outline the annotation process. Following this, we describe our evaluation methodology*and*conclude with a summary*of*issues that have arisen. ... Half*of*the sites marked one translation*first*,*and*the other half*of*the sites marked the second translation*first*. ...##
###
Automatic average-case analysis of algorithms

1991
*
Theoretical Computer Science
*

A fair fragment

doi:10.1016/0304-3975(91)90145-r
fatcat:yoecav3wjnhpnkc4z2tkoi42uu
*of*this*theory*is also incorporated into a system called Lambda-Upsilon-*Omega*. ... We then present some major components*of*the associated asymptotic*theory**and*exhibit a class*of*naturally arising functions that can be*automatically*analyzed. ... Expression(z) = C Expression,, l z"*and*rdiff(z) = C rdiff,, l z". n=O na0 The*first*one is the standard*counting*generating function*of*the expression*structures*. ...##
###
Don't Forget the Model in Your Model-based Reliability Coefficients: A Reply to McNeish (2018)

2019
*
Collabra: Psychology
*

*First*, we show that McNeish exaggerates the extent to which alpha is different from

*omega*when unidimensionality holds. ... on an exploratory bifactor solution ("Revelle's

*omega*total"),

*and*the glb ("greatest lower bound"). ... If the

*structure*

*of*the scale is best conceptualized as a correlated factors model or a second-

*order*factor model,

*omega*total will capture the variance due to all the extracted factors. ...

##
###
The Isomorphism Problem for omega-Automatic Trees
[article]

2010
*
arXiv
*
pre-print

The main result

arXiv:1004.0610v1
fatcat:vxixr3av7fgl5fhxb23qvsgjtq
*of*this paper is that the isomorphism for*omega*-*automatic*trees*of*finite height is at least has hard as second-*order*arithmetic*and*therefore not analytical. ... This strengthens a recent result by Hjorth, Khoussainov, Montalban,*and*Nies showing that the isomorphism problem for*omega*-*automatic**structures*is not Σ^1_2. ... One*of*the main motivations for investigating*automatic*graphs is that their*first*-*order**theories*can be decided uniformly (i.e., the input is an*automatic*presentation*and*a*first*-*order*sentence). ...##
###
The mate-in-n problem of infinite chess is decidable
[article]

2012
*
arXiv
*
pre-print

The proof proceeds by showing that the mate-in-n problem is expressible in what we call the

arXiv:1201.5597v4
fatcat:3ujxrrkx4rgsbicrjwgquuo6my
*first*-*order**structure**of*chess, which we prove (in the relevant fragment) is an*automatic**structure*, whose*theory*... Nevertheless, the main theorem*of*this article, confirming a conjecture*of*the*first*author*and*C. D. A. ... Since the*structure*Ch A is*automatic*, it follows by the decidability theorem*of**automatic**structures*[KN95, BG00] that the*first*-*order**theory**of*this*structure*is uniformly decidable. ...##
###
The Mate-in-n Problem of Infinite Chess Is Decidable
[chapter]

2012
*
Lecture Notes in Computer Science
*

The proof proceeds by showing that the mate-in-n problem is expressible in what we call the

doi:10.1007/978-3-642-30870-3_9
fatcat:6ob5b6nxcnd63gzftp3n57gqz4
*first*-*order**structure**of*chess Ch, which we prove (in the relevant fragment) is an*automatic**structure*, whose ... This issue is connected with transfinite game values in infinite chess,*and*the exact value*of*the*omega*one*of*chess ω chess 1 is not known. ... Since the*structure*Ch A is*automatic*, it follows by the decidability theorem*of**automatic**structures*[KN95, BG00] that the*first*-*order**theory**of*this*structure*is uniformly decidable. ...##
###
Cystic Fibrosis%3A Computing the World's First Cure for a Genetic Disease

2016
*
Figshare
*

A new computational approach, called the

doi:10.6084/m9.figshare.4104021.v1
fatcat:2j5fwnnzi5eiljegu3d4gremqi
*omega*algorithm, is developed, implemented*and*applied to find compounds that could potentially correct the delta F508 mutation responsible for cystic fibrosis. ... Cystic fibrosis (CF) affects millions*of*people worldwide. ... We can t a Markov model*of**order*0 to a specic piece*of*text by*counting*the number*of*occurrences*of*each letter in that text,*and*using these*counts*as probabilities. ...##
###
Lambda-Upsilon-Omega: An assistant algorithms analyzer
[chapter]

1989
*
Lecture Notes in Computer Science
*

Lambda-Upsilon-

doi:10.1007/3-540-51083-4_60
fatcat:5jvqldbvxzdi3k4h5347lvcp34
*Omega*, , is a system designed to perform*automatic*analysis*of*well-de ned classes*of*algorithms operating over \decomposable" data*structures*. ... The algebraic part relies on recent methodologies in combinatorial analysis based on systematic correspondences between*structural*type de nitions*and**counting*generating functions. ... Lambda-Upsilon-*Omega*, , is a system designed to perform*automatic*analysis*of*well-de ned classes*of*algorithms operating over \decomposable" data*structures*. ...
« Previous

*Showing results 1 — 15 out of 4,599 results*