6,788 research outputs found
State Complexity of Reversals of Deterministic Finite Automata with Output
We investigate the worst-case state complexity of reversals of deterministic
finite automata with output (DFAOs). In these automata, each state is assigned
some output value, rather than simply being labelled final or non-final. This
directly generalizes the well-studied problem of determining the worst-case
state complexity of reversals of ordinary deterministic finite automata. If a
DFAO has states and possible output values, there is a known upper
bound of for the state complexity of reversal. We show this bound can be
reached with a ternary input alphabet. We conjecture it cannot be reached with
a binary input alphabet except when , and give a lower bound for the
case . We prove that the state complexity of reversal depends
solely on the transition monoid of the DFAO and the mapping that assigns output
values to states.Comment: 18 pages, 3 tables. Added missing affiliation/funding informatio
k-Colorability is Graph Automaton Recognizable
Automata operating on general graphs have been introduced by virtue of
graphoids. In this paper we construct a graph automaton that recognizes
-colorable graphs
Block Sensitivity of Minterm-Transitive Functions
Boolean functions with symmetry properties are interesting from a complexity
theory perspective; extensive research has shown that these functions, if
nonconstant, must have high `complexity' according to various measures.
In recent work of this type, Sun gave bounds on the block sensitivity of
nonconstant Boolean functions invariant under a transitive permutation group.
Sun showed that all such functions satisfy bs(f) = Omega(N^{1/3}), and that
there exists such a function for which bs(f) = O(N^{3/7}ln N). His example
function belongs to a subclass of transitively invariant functions called the
minterm-transitive functions (defined in earlier work by Chakraborty).
We extend these results in two ways. First, we show that nonconstant
minterm-transitive functions satisfy bs(f) = Omega(N^{3/7}). Thus Sun's example
function has nearly minimal block sensitivity for this subclass. Second, we
give an improved example: a minterm-transitive function for which bs(f) =
O(N^{3/7}ln^{1/7}N).Comment: 10 page
Finite Computational Structures and Implementations
What is computable with limited resources? How can we verify the correctness
of computations? How to measure computational power with precision? Despite the
immense scientific and engineering progress in computing, we still have only
partial answers to these questions. In order to make these problems more
precise, we describe an abstract algebraic definition of classical computation,
generalizing traditional models to semigroups. The mathematical abstraction
also allows the investigation of different computing paradigms (e.g. cellular
automata, reversible computing) in the same framework. Here we summarize the
main questions and recent results of the research of finite computation.Comment: 12 pages, 3 figures, will be presented at CANDAR'16 and final version
published by IEEE Computer Societ
Counting Value Sets: Algorithm and Complexity
Let be a prime. Given a polynomial in \F_{p^m}[x] of degree over
the finite field \F_{p^m}, one can view it as a map from \F_{p^m} to
\F_{p^m}, and examine the image of this map, also known as the value set. In
this paper, we present the first non-trivial algorithm and the first complexity
result on computing the cardinality of this value set. We show an elementary
connection between this cardinality and the number of points on a family of
varieties in affine space. We then apply Lauder and Wan's -adic
point-counting algorithm to count these points, resulting in a non-trivial
algorithm for calculating the cardinality of the value set. The running time of
our algorithm is . In particular, this is a polynomial time
algorithm for fixed if is reasonably small. We also show that the
problem is #P-hard when the polynomial is given in a sparse representation,
, and is allowed to vary, or when the polynomial is given as a
straight-line program, and is allowed to vary. Additionally, we prove
that it is NP-hard to decide whether a polynomial represented by a
straight-line program has a root in a prime-order finite field, thus resolving
an open problem proposed by Kaltofen and Koiran in
\cite{Kaltofen03,KaltofenKo05}
- …