Given an n-tape nondeterministic finite automaton (NFA) M with a one-way read-only head per tape and a right end marker $ on each tape, and a nonnegative integer k, we say that M is weakly k-synchronized if for every ...
详细信息
Games are a classical model in the synthesis of controllers in the open setting. In particular, games of infinite length can represent systems which are not expected to reach a correct state, but rather to handle a co...
详细信息
ISBN:
(数字)9783540775669
ISBN:
(纸本)9783540775652
Games are a classical model in the synthesis of controllers in the open setting. In particular, games of infinite length can represent systems which are not expected to reach a correct state, but rather to handle a continuous stream of events. Yet, even longer sequences of events have to be considered when infinite sequences of events can occur in finite time - Zeno behaviours. In this paper, we extend two-player games to this setting by considering plays of ordinal length. Our two main results are determinacy of reachability games of length less than w(w) on finite arenas, and the PSPACE-completeness of deciding the winner in such a game.
We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg. Math. Sec. 1997). We develop a new class of automata, calle...
详细信息
ISBN:
(数字)9783540775669
ISBN:
(纸本)9783540775652
We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg. Math. Sec. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. the automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness problem). the second contribution of this paper is a new subclass of the rational tree relations, called separate-rational tree relations, defined via a natural restriction on asynchronous tree automata. these relations are closed under composition, preserve regular tree languages, and generate precisely the regular sets in the unary case (all these properties fail for the general model), and they are still more powerful than, for instance, the automatic tree relations.
this book constitutes the conference proceedings of the 48th International conference on currenttrends in theory and practice of computerscience, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15...
详细信息
ISBN:
(数字)9783031231018
ISBN:
(纸本)9783031231001
this book constitutes the conference proceedings of the 48th International conference on currenttrends in theory and practice of computerscience, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15–18, 2023.;this workshop focuses on graphs problems and optimization; graph drawing and visualization; NP-hardness and fixed parameter tractability; communication and temporal graphs; complexity and learning; and robots and strings.
the introduction into the field of software testing, automated software testing and diagnostics will be given together with explanation of fundamental terminology. the viewpoint of quality theory will be stressed. Pre...
详细信息
ISBN:
(纸本)3540413480
the introduction into the field of software testing, automated software testing and diagnostics will be given together with explanation of fundamental terminology. the viewpoint of quality theory will be stressed. Presented state of the art basic concepts of software testing, design of tests, their execution and methods of test evaluation will be selected according to their practical usage. the methodology will be demonstrated on case studies developed during practical software testing and diagnostics projects for large international companies in the field of industrial automation and medical instrumentation. the paper will be concluded with a summary of practical experience.
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's correspondence problem to be undecidabl...
详细信息
ISBN:
(数字)9783540775669
ISBN:
(纸本)9783540775652
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's correspondence problem to be undecidable and show its application to matrix semigroup problems, such as Any Diagonal Matrix Problem and Recurrent Matrix Problem. We also use infinite periodic traces in counter automaton models to show the undecidability of a new variation of the Infinite Post Correspondence Problem and Vector Ambiguity Problem for matrix semigroups.
Quality of collective inference relational graph classifier depends on a. degree of homophily in a classified graph. If we increase homophily in the graph, the classifier would assign class-membership to the instances...
详细信息
ISBN:
(纸本)9783642112652
Quality of collective inference relational graph classifier depends on a. degree of homophily in a classified graph. If we increase homophily in the graph, the classifier would assign class-membership to the instances with reduced error rate. We propose to substitute traditionally used graph neighborhood method (based on direct neighborhood of vertex) with local graph ranking algorithm (activation spreading), which provides wider set of neighboring vertices and their weights. We demonstrate that our approach increases homophily in the graph by inferring optimal homophily distribution of a binary Simple Relational Classifier in an unweighted graph. We validate this ability also experimentally using the Social Network of the Slovak Companies dataset.
the clique-chromatic number of a graph G = (V, E) denoted by chi(c)(G) is the smallest integer k such that there exists a partition of the vertex set of G into k subsets withthe property that no maximal clique of G i...
详细信息
ISBN:
(纸本)9783319042978;9783319042985
the clique-chromatic number of a graph G = (V, E) denoted by chi(c)(G) is the smallest integer k such that there exists a partition of the vertex set of G into k subsets withthe property that no maximal clique of G is contained in any of the subsets. Such a partition is called a k-clique-colouring of G. Recently Marx proved that deciding whether a graph admits a k-clique-colouring is Sigma(p)(2)-complete for every fixed k >= 2. Our main results are an O*(2(n)) time inclusion-exclusion algorithm to compute chi(c)(G) exactly, and a branching algorithm to decide whether a graph of bounded clique-size admits a 2-clique-colouring which runs in time O*(lambda(n)) for some lambda < 2.
the transitions of a stateless automaton do not depend on internal states but. solely on the symbols currently scanned by its heads accessing the input. or memory. We investigate stateless deterministic restarting aut...
详细信息
ISBN:
(纸本)9783540958901
the transitions of a stateless automaton do not depend on internal states but. solely on the symbols currently scanned by its heads accessing the input. or memory. We investigate stateless deterministic restarting automata that, after executing a rewrite step, Continue to read their tape before. performing a restart. Even the weakest class thus obtained contains the regular languages properly. the relations between different classes of stateless automata as well as between stateless automata and the corresponding types of automata with states are investigated, and it is shown that the language classes defined by the various types of deterministic stateless restarting automata without Auxiliary symbols are anti-AFLs that are not even closed under reversal.
Single look-ahead unit resolution (SLUR) algorithm is a nondeterministic polynomial time algorithm which for a given input formula in a conjunctive normal form (CNF) either outputs its satisfying assignment or gives u...
详细信息
暂无评论