相关论文: A language theoretic analysis of combings
We report some further developments regarding the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially ordered multisets (pomsets) with interfaces. We show a pumping lemma…
A perspective of statistical language models which emphasizes their collocational aspect is advocated. It is suggested that strings be generalized in terms of classes of relationships instead of classes of objects. The single most important…
A theory of how agents can come to understand a language is presented. If understanding a sentence $\alpha$ is to associate an operator with $\alpha$ that transforms the representational state of the agent as intended by the sender, then…
Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G)…
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…
The world's languages exhibit certain so-called typological or implicational universals; for example, Subject-Object-Verb (SOV) languages typically use postpositions. Explaining the source of such biases is a key goal of linguistics. We…
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…
We consider the logic space of countable (enumerated) groups and show that closed subspaces corresponding to some standard classes of groups have (do not have) generic groups. We also discuss the cases of semigroups and associative rings.
It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…
Commensurable groups are bi-interpretable, under suitable definability conditions.
We introduce regular language states, a family of quantum many-body states. They are built from a special class of formal languages, called regular, which has been thoroughly studied in the field of computer science. They can be understood…
We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…
The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…
We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a…
We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…
Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality…
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and…
We characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of…
We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…