32 research outputs found
Master index
Pla general, del mural ceràmic que decora una de les parets del vestíbul de la Facultat de Química de la UB. El mural representa diversos símbols relacionats amb la química
Reachability problems in low-dimensional nondeterministic polynomial maps over integers
We study reachability problems for various nondeterministic polynomial maps in Zn. We prove that the reachability problem for very simple three-dimensional affine maps (with independent variables) is undecidable and is PSPACE-hard for both two-dimensional affine maps and one-dimensional quadratic maps. Then we show that the complexity of the reachability problem for maps without functions of the form ±x+a0 is lower. In this case the reachability problem is PSPACE for any dimension and if the dimension is not fixed, then the problem is PSPACE-complete. Finally we extend the model by considering maps as language acceptors and prove that the universality problem is undecidable for two-dimensional affine maps
Recommended from our members
On two-way FA with monotonic counters and quadratic Diophantine equations
We show an interesting connection between two-way deterministic finite automata with monotonic counters and quadratic Diophantine equations. The automaton
M operates on inputs of the form
a
1
i
1
⋯
a
n
i
n
for some fixed
n and distinct symbols
a
1,…,
a
n
, where
i
1,…,
i
n
are nonnegative integers. We consider the following reachability problem: given a machine
M, a state
q, and a Presburger relation
E over counter values, is there (
i
1,…,
i
n
) such that
M, when started in its initial state on the left end of the input
a
1
i
1
⋯
a
n
i
n
with all counters initially zero, reaches some configuration where the state is
q and the counter values satisfy
E? In particular, we look at the case when the relation
E is an equality relation, i.e., a conjunction of relations of the form
C
i
=
C
j
. We show that this case and variations of it are equivalent to the solvability of some special classes of systems of quadratic Diophantine equations. We also study the nondeterministic version of two-way finite automata augmented with monotonic counters with respect to the reachability problem. Finally, we introduce a technique which uses decidability and undecidability results to show “separation” between language classes
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems
Tree Automata Techniques and Applications
International audienc
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..