Results 1 to 10 of about 1,772,322 (142)
Quotient Complexity of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented.
A. N. Maslov +35 more
core +8 more sources
The genus of regular languages [PDF]
Mathematical Structures in Computer Science, 2016 The paper defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, an FSA can be seen as a graph for which the notion of genus arises. At the same time, an FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus.
Bonfante, Guillaume, Deloup, Florian
openaire +5 more sources
Regular languages and associative language descriptions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization and can rather conveniently describe typical technical languages such as Pascal or HTML.
M. Anselmo +2 more
openaire +7 more sources
A Cognitive Regularizer for Language Modeling [PDF]
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2021 The uniform information density (UID) hypothesis, which posits that speakers behaving optimally tend to distribute information uniformly across a linguistic signal, has gained traction in psycholinguistics as an explanation for certain syntactic, morphological, and prosodic choices.
Wei, Jason +2 more
openaire +4 more sources
Maximally Atomic Languages [PDF]
, 2014 The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known.
Brzozowski, Janusz, Davies, Gareth
core +5 more sources
On the entropy of regular languages
Theoretical Computer Science, 2003 AbstractLet L be an irreducible regular language. Let W be a non-empty set of words (or sub-words) of L and denote by LW={v∈L:w⊏̸v,∀w∈W} the language obtained from L by forbidding all the words w in W. Then the entropy decreases strictly: ent(LW)
SCARABOTTI, Fabio +2 more
openaire +3 more sources
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects [PDF]
, 2015 A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law.
Sin'ya, Ryoma
core +2 more sources
Parameterized regular expressions and their languages [PDF]
Theoretical Computer Science, 2013 We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly ...
Barceló Baeza, Pablo +2 more
openaire +10 more sources
On the Structure and Complexity of Rational Sets of Regular Languages [PDF]
, 2013 In a recent thread of papers, we have introduced FQL, a precise specification language for test coverage, and developed the test case generation engine FShell for ANSI C.
Holzer, Andreas +3 more
core +2 more sources
On the Commutative Equivalence of Context-Free Languages [PDF]
, 2018 The problem of the commutative equivalence of context-free and regular languages is studied. In particular conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are ...
A Luca de +21 more
core +1 more source