Related papers: Quasigroup words and reversible automata
We give an axiomatic formulation of quantum structures like semilogics and quasilogics which generalize the boolean semirings of events and fuzzy logics. The notions of distributions, states, representations observables and semiobservables…
We adapt the abstract concepts of abelianness and centrality of universal algebra to the context of inverse semigroups. We characterize abelian and central congruences in terms of the corresponding congruence pairs. We relate centrality to…
For quasifields, the concept of parastrophy is slightly weaker than isotopy. Parastrophic quasifields yield isomorphic translation planes but not conversely. We investigate the right multiplication groups of finite quasifields. We classify…
We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a given probabilistic automaton accepts words with probability arbitrarily close to 1. This problem is known to be undecidable. However, different…
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
We use semiclassical methods to evaluate the spectral two-point correlation function of quantum chaotic systems with discrete geometrical symmetries. The energy spectra of these systems can be divided into subspectra that are associated to…
We call an affine algebraic supergroup quasireductive if its underlying algebraic group is reductive. We obtain some results about the structure and representations of reductive supergroups.
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently,…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…
This paper is concerned with a non-compact GIT quotient of a vector space, in the presence of an abelian group action and an equivariant regular function (potential) on the quotient. We define virtual counts of quasimaps from prestable…
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived…
We construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Steinberg. Additionally, the constructed group has a provably more difficult, namely EXPSPACE-complete, compressed word problem and acts over a…
Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…
A probabilistic model for computer-based generation of a machine translation system on the basis of English-Russian parallel text corpora is suggested. The model is trained using parallel text corpora with pre-aligned source and target…
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…
We discuss two results about projective representations of fundamental groups of quasiprojective varieties. The first is a realization result which, under a nonresonance assumption, allows to realize such representations as monodromy…