Results 41 to 50 of about 157,848 (165)
Ehrenfeucht-Fraisse Games on Omega-Terms [PDF]
, 2013 Fragments of first-order logic over words can often be characterized in terms of finite monoids or finite semigroups. Usually these algebraic descriptions yield decidability of the question whether a given regular language is definable in a particular ...
Huschenbett, Martin, Kufleitner, Manfred
core +5 more sources
Applying Algebraic Approaches for Modeling Workflows and their Transformations in Mobile Networks
Mobile Information Systems, Volume 2, Issue 1, Page 51-76, 2006., 2006 In emergency scenarios we can obtain a more effective coordination among team members, each of them equipped with hand‐held devices, through the use of workflow management software. Team members constitute a Mobile Ad‐hoc NETwork (MANET), whose topology both influences and is influenced by the workflow.
Paolo Bottoni +3 more
wiley +1 more source
Case Study on Algebraic Software Methodologies for Scientific Computing
Scientific Programming, Volume 8, Issue 4, Page 261-273, 2000., 2000 The use of domain specific languages and appropriate software architectures are currently seen as the way to enhance reusability and improve software productivity. Here we outline a use of algebraic software methodologies and advanced program constructors to improve the abstraction level of software for scientific computing.
Magne Haveraaen
wiley +1 more source
Going higher in the First-order Quantifier Alternation Hierarchy on Words [PDF]
, 2014 We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language to
H. Straubing +15 more
core +2 more sources
The omega-inequality problem for concatenation hierarchies of star-free languages [PDF]
, 2017 The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages.
Almeida, J., Klíma, O., Kunc, M.
core +2 more sources
Quantifiers on languages and codensity monads [PDF]
, 2017 This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one layer of various
Gehrke, Mai +2 more
core +1 more source
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
, 2010 The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V of languages, a being a letter from A.
Giovanni Pighizzini +3 more
core +2 more sources
Commutative positive varieties of languages
, 2017 We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter ...
Almeida, Jorge +2 more
core +1 more source
A Graph Model for Imperative Computation [PDF]
, 2010 Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values. We
Guy McCusker, Luke Ong, U. S. Reddy
core +3 more sources
An effective characterization of the alternation hierarchy in two-variable logic [PDF]
, 2012 We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the two-sided semidirect
Krebs, Andreas, Straubing, Howard
core +3 more sources