English
Related papers

Related papers: A survey on difference hierarchies of regular lang…

200 papers

The notion of a difference hierarchy, first introduced by Hausdorff, plays an important role in many areas of mathematics, logic and theoretical computer science such as descriptive set theory, complexity theory, and the theory of regular…

General Topology · Mathematics 2018-12-06 Célia Borlido , Mai Gehrke , Andreas Krebs , Howard Straubing

We introduce Hausdorff (complexity) classes, which provide canonical characterizations of the intermediate levels of the iterated exponential hierarchies, including the Polynomial Hierarchy, the (Weak) Exponential Hierarchy, and…

Computational Complexity · Computer Science 2026-04-14 Enrico Malizia

Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations.…

Formal Languages and Automata Theory · Computer Science 2019-02-14 Thomas Place , Marc Zeitoun

In the theory of formal languages, the understanding of concatenation hierarchies of regular languages is one of the most fundamental and challenging topic. In this paper, we survey progress made in the comprehension of this problem since…

Formal Languages and Automata Theory · Computer Science 2017-10-13 Thomas Place , Marc Zeitoun

This paper explores the fine-grained structure of classes of regular languages maintainable in fragments of first-order logic within the dynamic descriptive complexity framework of Patnaik and Immerman. A result by Hesse states that the…

Logic in Computer Science · Computer Science 2026-01-27 Corentin Barloy , Felix Tschirbs , Nils Vortmeier , Thomas Zeume

Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of…

Discrete Mathematics · Computer Science 2015-10-23 S. -L. Ng , M. B. Paterson

This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…

Formal Languages and Automata Theory · Computer Science 2021-11-19 Howard Straubing , Pascal Weil

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. In the past, two independent hierarchies have been obtained for external and internal…

Computational Complexity · Computer Science 2023-09-19 Bianca Truthe

Spoken language recognition (SLR) refers to the automatic process used to determine the language present in a speech sample. SLR is an important task in its own right, for example, as a tool to analyze or categorize large amounts of…

Computation and Language · Computer Science 2022-08-15 Luciana Ferrer , Diego Castan , Mitchell McLaren , Aaron Lawson

Methods and insights from statistical physics are finding an increasing variety of applications where one seeks to understand the emergent properties of a complex interacting system. One such area concerns the dynamics of language at a…

Physics and Society · Physics 2015-11-13 Richard A. Blythe

This paper presents a discriminative classifier for compositional data. This classifier is based on the posterior distribution of the Generalized Dirichlet which is the discriminative counterpart of Generalized Dirichlet mixture model.…

Machine Learning · Computer Science 2024-05-06 Elvis Togban , Djemel Ziou

This report is mostly written for educational purposes. It is meant as a self contained introduction to regular languages, regular expressions, and regular expression matching by using Brzozowski derivatives. As such it is mostly based on…

Formal Languages and Automata Theory · Computer Science 2019-08-01 Ola Wingbrant

We introduce {\it (W')-specification} in terms of language decompositions of subshifts, and show that any recurrence set of a subshift with this property has full Hausdorff dimension. Our main result applies to a wide class of subshifts…

Dynamical Systems · Mathematics 2026-03-06 Hiroki Takahasi

A regular language is $k$-lookahead deterministic (resp. $k$-block deterministic) if it is specified by a $k$-lookahead deterministic (resp. $k$-block deterministic) regular expression. These two subclasses of regular languages have been…

Formal Languages and Automata Theory · Computer Science 2015-12-18 Pascal Caron , Ludovic Mignot , Clément Miklarz

Using hierarchies of classes is one of the standard methods to solve multi-class classification problems. In the literature, selecting the right hierarchy is considered to play a key role in improving classification performance. Although…

Machine Learning · Computer Science 2021-01-28 Pablo del Moral , Slawomir Nowaczyk , Anita Sant'Anna , Sepideh Pashami

A clustering algorithm based on the Hausdorff distance is introduced and compared to the single and complete linkage. The three clustering procedures are applied to a toy example and to the time series of financial data. The dendrograms are…

Statistical Finance · Quantitative Finance 2010-01-30 N. Basalto , R. Bellotti , F. De Carlo , P. Facchi , E. Pantaleo , S. Pascazio

Eilenberg's variety theorem marked a milestone in the algebraic theory of regular languages by establishing a formal correspondence between properties of regular languages and properties of finite monoids recognizing them. Motivated by…

Formal Languages and Automata Theory · Computer Science 2020-11-16 Fabian Birkmann , Stefan Milius , Henning Urbat

I present the most fundamental features of an implemented system designed to manipulate representations of regular languages. The system is structured into two layers, allowing regular languages to be represented in an increasingly compact,…

Formal Languages and Automata Theory · Computer Science 2025-09-24 Baudouin Le Charlier

The focus of this paper is on the evaluation of sixteen labeling methods for hierarchical document clusters over five datasets. All of the methods are independent from clustering algorithms, applied subsequently to the dendrogram…

Information Retrieval · Computer Science 2018-05-28 Maria Fernanda Moura , Fabiano Fernandes dos Santos , Solange Oliveira Rezende

From school playgrounds to corporate boardrooms, status hierarchies -- rank orderings based on respect and perceived competence -- are universal features of human social organization. Language models trained on human-generated text…

Human-Computer Interaction · Computer Science 2026-01-27 Emilio Barkett
‹ Prev 1 2 3 10 Next ›