Displaying similar documents to “Automata with modulo counters and nondeterministic counter bounds”

Positioned agents in eco-grammar systems with border markers and pure regulated grammars

Miroslav Langer, Alica Kelemenová (2012)

Kybernetika

Similarity:

In this paper we follow our previous research in the field of positioned agents in the eco-grammar systems and pure grammars. We extend model of the positioned eco-grammar systems by boundary markers and we introduce bordered positioned eco-grammar systems (BPEG systems, for short) and that way we show one of the possible answers to the question stated in [9]. Namely we compare generative power of the BPEG systems with three types of pure regulated grammars with appearance checking. ...

On capacity regions of discrete asynchronous multiple access channels

Lóránt Farkas, Tamás Kói (2014)

Kybernetika

Similarity:

A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.

Product splittings for p-compact groups

W. Dwyer, C. Wilkerson (1995)

Fundamenta Mathematicae

Similarity:

We show that a connected p-compact group with a trivial center is equivalent to a product of simple p-compact groups. More generally, we show that product splittings of any connected p-compact group correspond bijectively to algebraic splittings of the fundamental group of the maximal torus as a module over the Weyl group. These are analogues for p-compact groups of well-known theorems about compact Lie groups.

Reverse mathematics of some topics from algorithmic graph theory

Peter Clote, Jeffry Hirst (1998)

Fundamenta Mathematicae

Similarity:

This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.