Results 11 to 20 of about 171,423 (283)
Bounded Counter Languages [PDF]
, 2012 We show that deterministic finite automata equipped with $k$ two-way heads are equivalent to deterministic machines with a single two-way input head and $k-1$ linearly bounded counters if the accepted language is strictly bounded, i.e., a subset of $a_1^*
B. Monien +9 more
core +2 more sources
Electronic Proceedings in Theoretical Computer Science, 2011 The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover,
Michaël Cadilhac +2 more
doaj +1 more source
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ...
Juhani Karhumaki, Aleksi Saarela
doaj +1 more source
Scope-Bounded Pushdown Languages [PDF]
International Journal of Foundations of Computer Science, 2014 We study the formal language theory of multistack pushdown automata (MPA) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped MPA). We show that scoped MPA are indeed a robust model of computation, by focusing on the corresponding theory of visibly MPA (MVPA).
LA TORRE, Salvatore +2 more
openaire +8 more sources
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [PDF]
Logical Methods in Computer Science, 2021 We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
James Laird
doaj +1 more source
On Bounded Rational Trace Languages [PDF]
Theory of Computing Systems, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Choffrut +2 more
openaire +1 more source
Decision trees for regular factorial languages
Array, 2022 In this paper, we study arbitrary regular factorial languages over a finite alphabet Σ. For the set of words L(n)of the length n belonging to a regular factorial language L, we investigate the depth of decision trees solving the recognition and the ...
Mikhail Moshkov
doaj +1 more source
Viability and resilience of languages in competition. [PDF]
PLoS ONE, 2010 We study the viability and resilience of languages, using a simple dynamical model of two languages in competition. Assuming that public action can modify the prestige of a language in order to avoid language extinction, we analyze two cases: (i) the ...
Laetitia Chapel +6 more
doaj +1 more source
Multi-Buffer Simulations for Trace Language Inclusion [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers before she executes them on her structure.
Milka Hutagalung +4 more
doaj +1 more source
Bounded repairability for regular tree languages [PDF]
Proceedings of the 15th International Conference on Database Theory, 2012 We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given target specification T. Specifically, we focus on the question of whether one can get from any tree in a regular language R to some tree in another regular language T with a finite,
Puppis, Gabriele +2 more
openaire +7 more sources