scientific article; zbMATH DE number 1944133

zbMATH Open1031.20049MaRDI QIDQ4407441FDOQ4407441

Authors: Pascal Tesson, Denis Thérien 

Publication date: 30 November 2003

Title of this publication is not available (Why is that?)

Recommendations

• Diamonds are forever
• Diamonds
• scientific article; zbMATH DE number 1820097
• Totally Multicolored diamonds
• scientific article; zbMATH DE number 1122204
• Diamond. A paradox logic
• JOINT DIAMONDS AND LAVER DIAMONDS
• scientific article; zbMATH DE number 7640987
• 1-consistency and the diamond

zbMATH Keywords

finite monoidsaperiodic semigroupspseudovarietiesregular \(\mathcal D\)-classes

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07)

Cited In (29)

• One quantifier alternation in first-order logic with modular predicates
• Fragments of first-order logic over infinite words
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• The power of programs over monoids in DA
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Language theoretical properties of hairpin formations
• On the lattice of sub-pseudovarieties of DA.
• Two algebraic approaches to variants of the concatenation product
• The word problem for omega-terms over the Trotter-Weil hierarchy
• The intersection problem for finite semigroups
• Unary and two-variable interval logics
• Separating Without Any Ambiguity.
• The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
• The intersection problem for finite monoids
• Polynomials, fragments of temporal logic and the variety DA over traces
• The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
• Learning expressions and programs over monoids
• The word problem for \(\omega \)-terms over DA
• On free spectra of finite monoids from the pseudovariety \(\mathsf{DA}\).
• Conservative groupoids recognize only regular languages
• Pseudovarieties of ordered completely regular semigroups
• Circuit complexity of regular languages
• Efficiency of automata in semi-commutation verification techniques
• On FO 2 Quantifier Alternation over Words
• How many times do you need to go back to the future in unary temporal logic?
• The Shuffle Product: New Research Directions
• Reversible regular languages: logical and algebraic characterisations
• Omega-rational expressions with bounded synchronization delay
• Geometrically closed positive varieties of languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407441)