Results 1 to 10 of about 872,680 (244)
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 +9 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.
A. V. Aho +20 more
core +7 more sources
Separation Property for wB- and wS-regular Languages [PDF]
Logical Methods in Computer Science, 2014 In this paper we show that {\omega}B- and {\omega}S-regular languages satisfy the following separation-type theorem If L1,L2 are disjoint languages of {\omega}-words both recognised by {\omega}B- (resp.
Skrzypczak, Michał
core +3 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
doaj +8 more sources
Complexity in Prefix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible.
A. Salomaa +15 more
core +3 more sources
Regular languages in NC1 [PDF]
Journal of Computer and System Sciences, 1992 AbstractWe give several characterizations, in terms of formal logic, semigroup theory, and operations on languages, of the regular languages in the circuit complexity class AC0, thus answering a question of Chandra, Fortune, and Lipton. As a by-product, we are able to determine effectively whether a given regular language is in AC0 and to solve in part
Mix Barrington, David A. +3 more
openaire +4 more sources
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.
Valdats, Maris
core +5 more sources
Regular omega-Languages with an Informative Right Congruence [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The same
Dana Angluin, Dana Fisman
doaj +2 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 +4 more sources
Separating Regular Languages with First-Order Logic [PDF]
Logical Methods in Computer Science, 2014 Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there exists a first ...
Place, Thomas, Zeitoun, Marc
core +4 more sources