Results 11 to 20 of about 1,782,235 (292)
Balanced-by-Construction Regular and ω-Regular Languages
International Journal of Foundations of Computer Science, 2021 Parenn is the typical generalization of the Dyck language to multiple types of parentheses. We generalize its notion of balancedness to allow parentheses of different types to freely commute. We show that balanced regular and [Formula: see text]-regular languages can be characterized by syntactic constraints on regular and [Formula: see text]-regular ...
Luc Edixhoven, Sung-Shik Jongmans
openaire +5 more sources
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
Odometers on Regular Languages [PDF]
Theory of Computing Systems, 2005 Odometers or "adding machines" are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this notion to systems defined on an arbitrary infinite regular language. In this latter situation, if (A,
Berthé,, Rigo, Michel
openaire +3 more sources
Weakly and Strongly Irreversible Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages ...
Giovanna J. Lavado +2 more
doaj +1 more source
New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ...
Jorge Almeida, Ondrej Klima
doaj +1 more source
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
Logical Methods in Computer Science, 2023 A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +1 more source
Internationalisation and modern languages in Scottish Further and Higher Education [PDF]
, 2009 This scoping study investigated the impact of internationalisation strategies on modern language provision in Scottish further and higher education and was commissioned by the Subject Centre for Languages, Linguistics and Area Studies. It follows on from
Doughty, H. +3 more
core +3 more sources
Testing the Equivalence of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 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.
Marco Almeida +2 more
doaj +1 more source
Boolean Circuit Complexity of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity.
Maris Valdats
doaj +1 more source
Computation of distances for regular and context-free probabilistic languages [PDF]
, 2008 Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning.
Satta, Giorgio +5 more
core +1 more source