Results 31 to 40 of about 1,782,235 (292)
Kleene Algebras, Regular Languages and Substructural Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce the two substructural propositional logics KL, KL+ , which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof.
Christian Wurm
doaj +1 more source
Separating regular languages with two quantifier alternations [PDF]
Logical Methods in Computer Science, 2018 We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes the first one ...
Thomas Place
doaj +1 more source
Nondeterministic State Complexity for Suffix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal ...
Yo-Sub Han, Kai Salomaa
doaj +1 more source
On regular languages over power sets
Journal of Language Modelling, 2016 The power set of a finite set is used as the alphabet of a string interpreting a sentence of Monadic Second-Order Logic so that the string can be reduced (in a straightforward way) to the symbols occurring in the sentence.
Tim Fernando
doaj +1 more source
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.
Michał Skrzypczak
doaj +1 more source
Dynamic Membership for Regular Languages [PDF]
, 2021 We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under letter substitutions on w.
Amarilli, Antoine +2 more
core +1 more source
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
Community languages in higher education : towards realising the potential [PDF]
, 2008 This study, Community Languages in Higher Education: Towards Realising the Potential, forms part of the Routes into Languages initiative funded by the Higher Education Funding Council in England (HEFCE) and the Department for Children, Schools and ...
McPake, Joanna +3 more
core +3 more sources
A survey on difference hierarchies of regular languages [PDF]
Logical Methods in Computer Science, 2018 Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages.
Olivier Carton +2 more
doaj +1 more source
Demonstratio Mathematica, 2004 Summary: This paper reviews and extends the recent work on signed real measure of regular languages within a unified framework. The language measure provides total ordering of partially ordered sets of sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different ...
Surana, Amit, Ray, Asok
openaire +2 more sources