95,834 research outputs found
Agent Based Models of Language Competition: Macroscopic descriptions and Order-Disorder transitions
We investigate the dynamics of two agent based models of language
competition. In the first model, each individual can be in one of two possible
states, either using language or language , while the second model
incorporates a third state XY, representing individuals that use both languages
(bilinguals). We analyze the models on complex networks and two-dimensional
square lattices by analytical and numerical methods, and show that they exhibit
a transition from one-language dominance to language coexistence. We find that
the coexistence of languages is more difficult to maintain in the Bilinguals
model, where the presence of bilinguals in use facilitates the ultimate
dominance of one of the two languages. A stability analysis reveals that the
coexistence is more unlikely to happen in poorly-connected than in fully
connected networks, and that the dominance of only one language is enhanced as
the connectivity decreases. This dominance effect is even stronger in a
two-dimensional space, where domain coarsening tends to drive the system
towards language consensus.Comment: 30 pages, 11 figure
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States
Stochastic languages are the languages recognized by probabilistic finite
automata (PFAs) with cutpoint over the field of real numbers. More general
computational models over the same field such as generalized finite automata
(GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin
proved the set of stochastic languages to be uncountable presenting a single
2-state PFA over the binary alphabet recognizing uncountably many languages
depending on the cutpoint. In this paper, we show the same result for unary
stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2-state unary
QFA, and a family of 3-state unary PFAs recognizing uncountably many languages;
all these numbers of states are optimal. After this, we completely characterize
the class of languages recognized by 1-state GFAs, which is the only nontrivial
class of languages recognized by 1-state automata. Finally, we consider the
variations of PFAs, QFAs, and GFAs based on the notion of inclusive/exclusive
cutpoint, and present some results on their expressive power.Comment: A new version with new results. Previous version: Arseny M. Shur,
Abuzer Yakaryilmaz: Quantum, Stochastic, and Pseudo Stochastic Languages with
Few States. UCNC 2014: 327-33
Multiplicative measures on free groups
We introduce a family of atomic measures on free groups generated by
no-return random walks. These measures are shown to be very convenient for
comparing "relative sizes" of subgroups, context-free and regular subsets
(that, subsets generated by finite automata) of free groups. Many asymptotic
characteristics of subsets and subgroups are naturally expressed as analytic
properties of related generating functions. We introduce an hierarchy of
asymptotic behaviour "at infinity" of subsets in the free groups, more
sensitive than the traditionally used asymptotic density, and apply it to
normal subgroups and regular subsets.Comment: LaTeX, requires amssymb.sty; 31 pp Version 3: more detail in Example
2 and Tauberian theorem
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine
regular languages equality. Antimirov and Mosses proposed a rewrite system for
deciding regular expressions equivalence of which Almeida et al. presented an
improved variant. Hopcroft and Karp proposed an almost linear algorithm for
testing the equivalence of two deterministic finite automata that avoids
minimisation. In this paper we improve the best-case running time, present an
extension of this algorithm to non-deterministic finite automata, and establish
a relationship between this algorithm and the one proposed in Almeida et al. We
also present some experimental comparative results. All these algorithms are
closely related with the recent coalgebraic approach to automata proposed by
Rutten
- …