Results 11 to 20 of about 1,048 (100)

Regular realizability problems and context-free languages

open access: yesWorkshop on Descriptional Complexity of Formal Systems, 2015
We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language called filter is non-empty. In this paper we focus on the case of context-
A Yakaryılmaz   +11 more
core   +2 more sources

Running Time Analysis of Broadcast Consensus Protocols [PDF]

open access: yesFoundations of Software Science and Computation Structures24th International Conference, 2021
Broadcast consensus protocols (BCPs) are a model of computation, in which anonymous, identical, finite-state agents compute by sending/receiving global broadcasts.
Czerner P, Jaax S.
europepmc   +3 more sources

Solution sets for equations over free groups are EDT0L languages [PDF]

open access: yesInternational journal of algebra and computation, 2015
We show that, given an equation over a finitely generated free group, the set of all solutions in reduced words forms an effectively constructible EDT0L language.
L. Ciobanu, V. Diekert, M. Elder
semanticscholar   +1 more source

Monopole Condensation and Polyakov Loop in Finite-Temperature Pure QCD [PDF]

open access: yes, 1996
We study the relation between the abelian monopole condensation and the deconfinement phase transition of the finite-temperature pure QCD. The expectation value of the monopole contribution to the Polyakov loop becomes zero when a long monopole loop is ...
'tHooft   +9 more
core   +3 more sources

Exploring Capabilities within ForTrilinos by Solving the 3D Burgers Equation

open access: yesScientific Programming, Volume 20, Issue 3, Page 275-292, 2012., 2012
We present the first three‐dimensional, partial differential equation solver to be built atop the recently released, open‐source ForTrilinos package (http://trilinos.sandia.gov/packages/fortrilinos). ForTrilinos currently provides portable, object‐oriented Fortran 2003 interfaces to the C++ packages Epetra, AztecOO and Pliris in the Trilinos library ...
Karla Morris   +3 more
wiley   +1 more source

Translation from Classical Two-Way Automata to Pebble Two-Way Automata [PDF]

open access: yes, 2009
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional "pebble" movable along the input tape.
A. Szepietowski   +24 more
core   +4 more sources

Passively mobile communicating machines that use restricted space [PDF]

open access: yesInternational Workshop on Foundations of Mobile Computing, 2010
We propose a new theoretical model for passively mobile Wireless Sensor Networks, called PM, standing for Passively mobile Machines. The main modification w.r.t. the Population Protocol model [Angluin et al. 2006] is that the agents now, instead of being
I. Chatzigiannakis   +4 more
semanticscholar   +1 more source

Computer graphics technologies in temperature space research of industrial building interiors

open access: yesBudownictwo o Zoptymalizowanym Potencjale Energetycznym, 2019
Taking into account the multi parameter character of the investigated process, the means of multidimensional applied geometry for constructing a graphic model of the temperature space of an industrial building interior wasproposed.
Olena Gumen   +3 more
doaj   +1 more source

Space hierarchy theorem revised [PDF]

open access: yes, 2003
We show that, for an arbitrary function h(n) and each recursive function ℓ(n), that are separated by a nondeterministically fully space constructible g(n), such that h(n)∈Ω(g(n)) but ℓ(n)∉Ω(g(n)), there exists a unary language L in NSPACE(h(n)) that is ...
Aarts, Leon P.   +5 more
core   +1 more source

Complete Symmetry in D2L Systems and Cellular Automata [PDF]

open access: yes, 1985
We introduce completely symmetric D2L systems and cellular automata by means of an additional restriction on the corresponding symmetric devices. Then we show that completely symmetric D2L systems and cellular automata are still able to simulate Turing ...
Asveld, Peter R.J.
core   +5 more sources

Home - About - Disclaimer - Privacy