Recommendations
Cites work
- scientific article; zbMATH DE number 988805 (Why is no real title available?)
- scientific article; zbMATH DE number 988806 (Why is no real title available?)
- scientific article; zbMATH DE number 988808 (Why is no real title available?)
- scientific article; zbMATH DE number 3827223 (Why is no real title available?)
- scientific article; zbMATH DE number 4035179 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3724720 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 459336 (Why is no real title available?)
- scientific article; zbMATH DE number 459360 (Why is no real title available?)
- scientific article; zbMATH DE number 475428 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 798167 (Why is no real title available?)
- scientific article; zbMATH DE number 864845 (Why is no real title available?)
- A Conjecture on the Hall Topology for the Free Group
- A Reiterman theorem for pseudovarieties of finite first-order structures
- A generalization of the Schützenberger product of finite monoids
- A property of the Schützenberger product
- A topology for free groups and related groups
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Characterizations of locally testable events
- Characterizations of some classes of regular events
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- Closure of varieties of languages under products with counter
- Equations and dot-depth one
- Factorization forests of finite height
- Finite semigroup varieties of the form V*D
- First-order logic and star-free sets
- Games, equations and dot-depth two monoids
- Games, equations and the dot-depth hierarchy
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- INVERSE MONOIDS OF DOT-DEPTH TWO
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- Inverse monoids of dot-depth two
- Locally trivial categories and unambiguous concatenation
- Logic, semigroups and automata on words
- On The Profinite Topology on a Free Group
- On a complete set of generators for dot-depth two
- On a conjecture concerning dot-depth two languages
- On dot-depth two
- On finite monoids having only trivial subgroups
- Partially ordered finite monoids and a theorem of I. Simon
- Polynomial closure of group languages and open sets of the Hall topology
- Polynomial operations and hierarchies of concatenation
- Profinite semigroups, Mal'cev products, and identities
- Semigroups and languages of dot-depth two
- Some logical characterizations of the dot-depth hierarchy and applications
- Some results on the dot-depth hierarchy
- Sur le produit de concatenation non ambigu
- Sur mon article Une topologie du monoide libre
- The Birkhoff theorem for finite algebras
- The dot-depth hierarchy of star-free languages is infinite
- Topologies for the free monoid
- Une topologie du monoide libre
- Varieties of ordered algebras
Cited in
(89)- Regular languages and partial commutations
- Schreier split extensions of preordered monoids
- Perfect correspondences between dot-depth and polynomial-time hierarchies
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity
- Some results onC-varieties
- One quantifier alternation in first-order logic with modular predicates
- A Reiterman theorem for pseudovarieties of finite first-order structures
- PROFINITE METHODS IN SEMIGROUP THEORY
- Hierarchies and reducibilities on regular languages related to modulo counting
- On Existentially First-Order Definable Languages and Their Relation to NP
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Permutation rewriting and algorithmic verification
- Dot-depth three, return of the j-class
- All about unambiguous polynomial closure
- Factorization forests for infinite words and applications to countable scattered linear orderings
- A Note on Decidable Separability by Piecewise Testable Languages
- Some complexity results for polynomial rational expressions.
- On the Weihrauch degree of the additive Ramsey theorem
- A note on partially ordered tree automata
- Partially ordered two-way Büchi automata
- The factorisation forest theorem
- Theme and variations on the concatenation product
- Separating regular languages with two quantifier alternations
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
- On Shuffle Ideals
- A counterexample to a conjecture concerning concatenation hierarchies
- Two algebraic approaches to variants of the concatenation product
- Covering and separation for logical fragments with modular predicates
- Forbidden patterns for ordered automata
- Varieties
- Hilbert's tenth problem for term algebras with a substitution operator
- Defining long words succinctly in FO and MSO
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- Complemented subsets and Boolean-valued, partial functions
- Local testability from words to traces, a suitable definition
- Varieties and pseudovarieties of ordered normal bands
- Closure of varieties of languages under products with counter
- Separating Without Any Ambiguity.
- Generic results for concatenation hierarchies
- scientific article; zbMATH DE number 4035179 (Why is no real title available?)
- Polynomials, fragments of temporal logic and the variety DA over traces
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- Polynomial Operators on Classes of Regular Languages
- Polynomial operations and hierarchies of concatenation
- On the non-deterministic communication complexity of regular languages
- Languages polylog-time reducible to dot-depth 1/2
- Algebraic tools for the concatenation product.
- Factorization Forests
- The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin
- Machines that can output empty words
- scientific article; zbMATH DE number 7407796 (Why is no real title available?)
- scientific article; zbMATH DE number 7350780 (Why is no real title available?)
- Two non-closure results on families ofL languages
- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
- A generic characterization of generalized unary temporal logic and two-variable first-order logic
- Conservative groupoids recognize only regular languages
- Hierarchies of Piecewise Testable Languages
- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages
- Efficiency of automata in semi-commutation verification techniques
- Imre Simon: an exceptional graduate student
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- The amazing mixed polynomial closure and its applications to two-variable first-order logic
- The regular languages of first-order logic with one alternation
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- The Quantifier Alternation Hierarchy of Synchronous Relations
- A reducibility for the dot-depth hierarchy
- Equational descriptions of languages
- Polynomial closure
- The Height of Factorization Forests
- Unambiguity in automata theory
- Equations Defining the Polynomial Closure of a Lattice of Regular Languages
- On decidability of intermediate levels of concatenation hierarchies
- On FO 2 Quantifier Alternation over Words
- A conjecture on the concatenation product
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- How many times do you need to go back to the future in unary temporal logic?
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
- Around dot-depth one
- Partially ordered two-way Büchi automata
- Quantifier alternation for infinite words
- Languages of dot-depth 3/2
- The covering problem
- Concatenation hierarchies: new bottle, old wine
- An explicit formula for the intersection of two polynomials of regular languages
- scientific article; zbMATH DE number 7376042 (Why is no real title available?)
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Closing star-free closure
- On fixed points of the lower set operator
This page was built for publication: Polynomial closure and unambiguous product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361889)
