Results 1 to 10 of about 63,143 (195)
The Complexity of Infinite Computations In Models of Set Theory [PDF]
Logical Methods in Computer Science, 2009 We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are \pi_2^0-sets, while ...
Olivier Finkel
doaj +7 more sources
ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES [PDF]
International Journal of Foundations of Computer Science, 2004 In a recent paper, Altenbernd, Thomas and Wöhrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the Büchi and Muller ones, firstly used for infinite words. The authors asked for comparing the tiling system acceptance with an acceptance
Finkel, Olivier
openaire +6 more sources
Das Erleben der Langeweile und der Aktivierungsprozess der Kinder im frühschulischen DaF-Unterricht [PDF]
Linguistische Treffen in Wrocław, 2021 Curiosity and thirst for knowledge are characteristic features of children, which manifest themselves in the fact that an infinite number of questions are asked.
Louise van Wijgerden
doaj +1 more source
Highly Undecidable Problems For Infinite Computations [PDF]
, 2009 We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable".
Finkel, Olivier
core +6 more sources
Rewriting Logic Semantics of a Plan Execution Language [PDF]
, 2010 The Plan Execution Interchange Language (PLEXIL) is a synchronous language developed by NASA to support autonomous spacecraft operations. In this paper, we propose a rewriting logic semantics of PLEXIL in Maude, a high-performance logical engine.
A. Verdejo +25 more
core +4 more sources
, 2013 For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras.
Adámek, Jiří +3 more
core +3 more sources
Designing a programming-based approach for modelling scientific phenomena [PDF]
, 2005 We describe an iteratively designed sequence of activities involving the modelling of 1- dimensional collisions between moving objects based on programming in ToonTalk.
Hoyles, Celia +2 more
core +3 more sources
Decision Problems for Recognizable Languages of Infinite Pictures
CoRR, 2010 Altenbernd, Thomas and Wöhrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the Büchi and Muller ones, firstly used for infinite words.
openaire +3 more sources
Subshifts as Models for MSO Logic
, 2013 We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts.
Jeandel, Emmanuel, Theyssier, Guillaume
core +3 more sources
Hyperbolic tilings and formal language theory
, 2013 In this paper, we try to give the appropriate class of languages to which belong various objects associated with tessellations in the hyperbolic plane.Comment: In Proceedings MCU 2013, arXiv:1309 ...
Margenstern, Maurice, Subramamian, K. G.
core +2 more sources