Unary Prime Languages

@inproceedings{Jecker2020UnaryPL,
  title={Unary Prime Languages},
  author={Isma{\"e}l Jecker and Orna Kupferman and Nicolas Mazzocchi},
  booktitle={MFCS},
  year={2020}
}
11 A regular language L of finite words is composite if there are regular languages L1, L2, . . . , Lt such 12 that L = ⋂t i=1 Li and the index (number of states in a minimal DFA) of every language Li is strictly 13 smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced 14 and studied in [9], where the complexity of deciding the primality of the language of a given DFA 15 was left open, with a doubly-exponential gap between the upper and lower bounds… 
2 Citations

Figures from this paper

Decomposing Permutation Automata
TLDR
An NP algorithm is provided to decide whether a permutation DFA is composite, and it is shown that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete.

References

SHOWING 1-10 OF 10 REFERENCES
Linear automaton transformations
TLDR
For a finite commutative ring with unit the authors determine which linear transformations M: RN—+RN can be realized by finite automata.
On the base-dependence of sets of numbers recognizable by finite automata
  • A. Cobham
  • Computer Science
    Mathematical systems theory
  • 2005
TLDR
It is shown that the only sets recognizable independently of base are those which are ultimately periodic; others, if recognizable at all, are recognizable only in bases which are powers of some fixed positive integer.
An Introduction to the Theory of Numbers
  • E. T.
  • Mathematics
    Nature
  • 1946
THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.
Monadic Second-Order Logics with Cardinalities
We delimit the boundary between decidability versus undecidability of the weak monadic second-order logic of one successor (WS1S) extended with linear cardinality constraints of the form
Decomposition of safe langauges
  • 2018
On the existence of prime 469 decompositions
  • Theoretical Computer Science
  • 2007
Parallel decompositions of finite automata
  • Compositionality : The Significant 464 Difference . Proceedings of Compositionality Workshop , volume 1536 of Lecture Notes in 465 Computer Science
  • 1998
Algebraic theory of machines. i. prime decomposition theorem 476 for finite semigroups and machines. Transactions of the
  • 1965
Finite automata and the representation of events
  • 1957
Existance of reduction hierarchies
  • Proc