On a problem of Brzozowski and Fich
نویسنده
چکیده
The problem of decidability of membership in the semidirect product Sl L of the pseudovarieties Sl of all nite semilattices and L of all nite L-trivial semigroups has been around since 1984. This paper discusses several developments motivated by this question and leading to a proof that settles it aarmatively.
منابع مشابه
Nominal Kleene Coalgebra
We develop the coalgebraic theory of nominal Kleene algebra, including an alternative language-theoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulation-based decision procedure for the equational theory.
متن کاملDecision Problems for Convex Languages
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but the problem is PSPACE-hard if L is represented by an NFA. If a regular language is not convex, we prove tight u...
متن کاملMeasuring the Value of Refining a Web Presence
The redesign of a Web presence can be classified as both an IT investment and an e-commerce initiative. Although the empirical literature provides evidence that financial markets are sensitive to e-commerce announcements, it is still unknown what types of announcements affect the value of firms. We use the event study methodology on a sample of Web site redesigns from 1995 to 1999 to investigat...
متن کاملApplications of Brzozowski derivatives to XML Schema processing
Given a regular language L, the Brzozowski derivative of L with respect to some string s is a regular expression which defines what strings can follow s in strings appearing in L. The calculation of Brzozowski derivatives is a convenient and beautiful tool for the algebraic manipulation of content models. It can provide convenient solutions to several problems arising in developing, manipulatin...
متن کاملHandle Atoms with Care
Atoms of a (regular) language L were introduced by Brzozowski and Tamm in 2011 as intersections of complemented and uncomplemented quotients of L. They derived tight upper bounds on the complexity of atoms in 2013. In 2014, Brzozowski and Davies characterized the regular languages meeting these bounds. To achieve these results, they used the so-called “átomaton” of a language, introduced by Brz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007