Results 11 to 20 of about 146,057 (221)
Towards MKM in the Large: Modular Representation and Scalable Software Architecture [PDF]
, 2010 MKM has been defined as the quest for technologies to manage mathematical knowledge. MKM "in the small" is well-studied, so the real problem is to scale up to large, highly interconnected corpora: "MKM in the large". We contend that advances in two areas
Kohlhase, Michael +2 more
core +2 more sources
Eilenberg Theorems for Free [PDF]
, 2017 Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
From a Natural to a Formal Language with DSL Assistant [PDF]
ACM/IEEE International Conference on Model Driven Engineering Languages and SystemsThe development of domain-specific languages (DSLs) is a laborious and iterative process that seems to naturally lean to the use of generative artificial intelligence.
My M. Mosthaf, Andrzej Wasowski
semanticscholar +1 more source
, 2009 Large and complex meta-models such as those of Uml and its profiles are growing due to modelling and inter-operability needs of numerous\ud stakeholders. The complexity of such meta-models has led to coining\ud of the term meta-muddle. Individual users
A. Deursen van +7 more
core +4 more sources
Decidability and Shortest Strings in Formal Languages [PDF]
Workshop on Descriptional Complexity of Formal Systems, 2011 Given a formal language L specified in various ways, we consider the problem of determining if L is nonempty. If L is indeed nonempty, we find upper and lower bounds on the length of the shortest string in L.
L. Alpoge +3 more
semanticscholar +1 more source
Generic Model Refactorings [PDF]
, 2009 Many modeling languages share some common concepts and principles. For example, Java, MOF, and UML share some aspects of the concepts\ud of classes, methods, attributes, and inheritance.
B.C.D.S. Oliveira +17 more
core +6 more sources
Groups whose word problems are not semilinear [PDF]
, 2018 Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled Artin group ...
Gilman, Robert H. +2 more
core +2 more sources
Crowdsourcing Dialect Characterization through Twitter [PDF]
, 2014 We perform a large-scale analysis of language diatopic variation using geotagged microblogging datasets. By collecting all Twitter messages written in Spanish over more than two years, we build a corpus from which a carefully selected list of concepts ...
Bruno Gonçalves +8 more
core +7 more sources
On computational complexity of Set Automata
, 2017 We consider a computational model which is known as set automata. The set automata are one-way finite automata with an additional storage---the set. There are two kinds of set automata---the deterministic and the nondeterministic ones.
Rubtsov, Alexander A. +1 more
core +1 more source
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 +2 more sources