Results 11 to 20 of about 2,243,395 (337)
Hyperbolic tilings and formal language theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this paper, we try to give the appropriate class of languages to which belong various objects associated with tessellations in the hyperbolic plane.
Maurice Margenstern, K.G. Subramamian
doaj +4 more sources
Formal Semantics of the CHART Transformation Language [PDF]
, 2011 The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples an a relation. Many database languages and systems do require multi-set semantics though, either because of functional requirements or because of the high costs
Mol, Maarten de, Rensink, Arend
core +13 more sources
A Theory of Formal Choreographic Languages
Logical Methods in Computer Science, 2023 We introduce a meta-model based on formal languages, dubbed formal choreographic languages, to study message-passing systems. Our framework allows us to generalise standard constructions from the literature and to compare them. In particular, we consider notions such as global view, local view, and projections from the former to the latter.
Barbanera, F, Lanese, I, Tuosto, E
openaire +7 more sources
Formal Languages, Formally and Coinductively [PDF]
Logical Methods in Computer Science, 2017 Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and elegant proofs of classic results in language theory.
openaire +8 more sources
The Maximal Complexity of Quasiperiodic Infinite Words
Axioms, 2021 A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the string. An infinite string is referred to as quasiperiodic if it has a quasiperiod.
Ludwig Staiger
doaj +1 more source
On formal universals in phonology [PDF]
, 2009 Understanding the universal aspects of human language structure requires comparison at multiple levels of analysis. While Evans & Levinson (E&L) focus mostly on substantive variation in language, equally revealing insights can come from studying formal ...
Nevins, A
core +1 more source
Factorization in Formal Languages [PDF]
, 2015 We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L).
Paul C. Bell +2 more
openaire +2 more sources
Formalizing Homogeneous Language Embeddings [PDF]
Electronic Notes in Theoretical Computer Science, 2010 The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but ...
Clark, Tony, Tratt, Laurence
openaire +6 more sources
Language and language : Approaches to metaphor
Corela, 2016 The work of Pierre-Yves Raccah is characterized by great precision and rigour; this is well illustrated by the terminological distinction he has established between natural language (such as French or English), and formal language as employed by ...
John Stewart
doaj +1 more source
Formal Basis of a Language Universal
Computational Linguistics, 2021 Steedman (2020) proposes as a formal universal of natural language grammar that grammatical permutations of the kind that have given rise to transformational rules are limited to a class known to mathematicians and computer scientists as the “separable ...
Miloš Stanojević, Mark Steedman
doaj +1 more source