English
Related papers

Related papers: Word equations, constraints, and formal languages

200 papers

Some aspects of the physical nature of language are discussed. In particular, physical models of language must exist that are efficiently implementable. The existence requirement is essential because without physical models no communication…

Quantum Physics · Physics 2007-05-23 Paul Benioff

We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…

Group Theory · Mathematics 2025-04-01 André Carvalho , Carl-Fredrik Nyberg-Brodda

In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Olivier Carton , Luc Boasson

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the second in a series of papers in…

Operator Algebras · Mathematics 2016-09-07 Massoud Amini , Alireza Medghalchi

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Group Theory · Mathematics 2015-10-09 Tara Brough

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

Particularly in transgender and nonbinary (TGNB) communities, it is an increasingly common practice to publicly share one's personal pronouns so that we may be gendered correctly in others' speech. Many of us have nuanced desires for how we…

Computation and Language · Computer Science 2024-10-01 Rose Bohrer , Ashe Neth

It is shown how to extend the formal variational calculus in order to incorporate integrals of divergences into it. Such a generalization permits to study nontrivial boundary problems in field theory on the base of canonical formalism.

High Energy Physics - Theory · Physics 2007-05-23 Vladimir O. Soloviev

Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Adopting this perspective, we generalise two existing program…

Programming Languages · Computer Science 2025-12-15 Jack Liell-Cock , Zev Shirazi , Sam Staton

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…

Logic in Computer Science · Computer Science 2014-10-23 Henning Schnoor

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…

Formal Languages and Automata Theory · Computer Science 2010-10-27 Arseny M. Shur

We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…

Logic in Computer Science · Computer Science 2007-05-23 Patrick Dehornoy

Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…

Logic in Computer Science · Computer Science 2024-12-18 Ali K. Caires-Santos , Maribel Fernández , Daniele Nantes-Sobrinho

The explicit relationship among perception, communication, and design is being discussed in some detail, in order to relate it to characteristic details of the modeling of the world which defines the scientific and artistic activities of…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 R. E. Zimmermann , S. Ley , V. G. Budanov , V. E. Voitsekhovitch

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both…

Logic in Computer Science · Computer Science 2017-04-25 Lauri Hella , Antti Kuusisto , Arne Meier , Jonni Virtema

Semantic role theory considers roles as a small universal set of unanalyzed entities. It means that formally there are no restrictions on role combinations. We argue that the semantic roles co-occur in verb representations. It means that…

Computation and Language · Computer Science 2018-10-10 Aliaksandr Huminski , Hao Zhang , Gangeshwar Krishnamurthy

Natural language contexts display logical regularities with respect to substitutions of related concepts: these are captured in a functional order-theoretic property called monotonicity. For a certain class of NLI problems where the…

Computation and Language · Computer Science 2021-05-18 Julia Rozanova , Deborah Ferreira , Mokanarangan Thayaparan , Marco Valentino , André Freitas