Related papers: On groups whose word problem is solved by a nested…
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a retract and so algebraically closed of the full group.
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
We show that for any two distinct words $ s_1, s_2 $ over an arbitrary alphabets, there exists a deterministic finite automaton with $ O(\log^2 n) $ states that accepts $ s_1 $ and rejects $ s_2 $. This improves the previous upper bound of…
This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…
Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata. They…
Register automata are finite automata equipped with a finite set of registers ranging over the domain of some relational structure like $(\mathbb N;=)$ or $(\mathbb Q;<)$. Register automata process words over the domain, and along a run of…
A fundamental question in logic and verification is the following: for which unary predicates $P_1, \ldots, P_k$ is the monadic second-order theory of $\langle \mathbb{N}; <, P_1, \ldots, P_k \rangle$ decidable? Equivalently, for which…
A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various…
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…
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…
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…
A compactified horizontal visibility graph for the language network is proposed. It was found that the networks constructed in such way are scale free, and have a property that among the nodes with largest degrees there are words that…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
We show that the word problem for any 3-manifold group is solvable in time $O(n\log^3 n)$. Our main contribution is the proof that the word problem for admissible graphs of groups, in the sense of Croke and Kleiner, is solvable in $O(n\log…
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a…
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an…