scientific article; zbMATH DE number 3495598
From MaRDI portal
Publication:4077455
Cited in
(only showing first 100 items - show all)- Une généralisation des théorèmes de Higman et de Simon aux mots infinis
- Characterizations of some classes of regular events
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- Membership testing in commutative transformation semigroups
- Semigroups and languages of dot-depth two
- Partially ordered finite monoids and a theorem of I. Simon
- Inverse monoids of dot-depth two
- On finite \(\mathcal J\)-trivial monoids
- Series formelles et algèbres syntactiques
- Languages of R-trivial monoids
- Variétés de langages et monoide des parties
- A generalization of the Schützenberger product of finite monoids
- Classification of finite monoids: the language approach
- Polynomial operations and hierarchies of concatenation
- On power commutative semigroups
- On a conjecture concerning dot-depth two languages
- Games, equations and dot-depth two monoids
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids
- Some results on the dot-depth hierarchy
- A generalization of finiteness
- Syntaktische Monoide und Hypercodes
- The dot-depth hierarchy of star-free languages is infinite
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- Trees, congruences and varieties of finite semigroups
- Free profinite R-trivial, locally idempotent and locally commutative semigroups
- Equations and monoid varieties of dot-depth one and two
- On a complete set of generators for dot-depth two
- Well quasi-orders and regular languages
- Over testable languages
- Monoids respecting \(n\)-chains of intervals
- Polynomial closure and unambiguous product
- A proof of Simon's theorem on piecewise testable languages
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
- An efficient null-free procedure for deciding regular language membership
- LANGAGE: A Maple package for automaton characterization of regular languages
- Right and left locally testable languages
- The word problem for omega-terms over the Trotter-Weil hierarchy
- Separability by piecewise testable languages is \textsc{PTime}-complete
- On shuffle products, acyclic automata and piecewise-testable languages
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Computing finite semigroups
- Logic, semigroups and automata on words
- Games, equations and the dot-depth hierarchy
- Algebraic tools for the concatenation product.
- Languages defined with modular counting quantifiers
- Some complexity results for polynomial rational expressions.
- Bilateral locally testable languages.
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
- Inclusion relations between some congruences related to the dot-depth hierarchy
- Finite basis problem for involution monoids of unitriangular Boolean matrices
- Subsequence versus substring constraints in sequence pattern languages
- Schreier split extensions of preordered monoids
- Varieties
- Characterizing level one in group-based concatenation hierarchies
- String inference from longest-common-prefix array
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- On Simon's congruence closure of a string
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- First-order logic and its infinitary quantifier extensions over countable words
- Identities of the stylic monoid
- Measuring power of locally testable languages
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- Finite semigroup varieties of the form V*D
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- A sufficient condition to polynomially compute a minimum separating DFA
- Generic results for concatenation hierarchies
- On Boolean combinations forming piecewise testable languages
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
- On the index of Simon's congruence for piecewise testability
- The structure of finite monoids satisfying the relation \(\mathcal R=\mathcal H\).
- On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\).
- Constructing divisions into power groups
- Characterization of the pseudovariety generated by finite monoids satisfying \(\mathcal R=\mathcal H\).
- Alternating complexity of counting first-order logic for the subword order
- Absent subsequences in words
- Syntactic semigroup problem for the semigroup reducts of affine near-semirings over Brandt semigroups.
- Quantifier alternation for infinite words
- Geometric grid classes of permutations
- Approximate comparison of functions computed by distance automata
- Regular languages of thin trees
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- On upper and lower bounds on the length of alternating towers
- Alternation hierarchies of first order logic with regular predicates
- A Note on Decidable Separability by Piecewise Testable Languages
- Canonical finite models of Kleene algebra with tests
- Efficient Reconstruction of RC-Equivalent Strings
- An Algebraic Characterization of Strictly Piecewise Languages
- Theme and variations on the concatenation product
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
- A conjecture on the concatenation product
- Injective envelopes of transition systems and Ferrers languages
- Hierarchies of Piecewise Testable Languages
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Factorization Forests
- scientific article; zbMATH DE number 3910655 (Why is no real title available?)
- Regular languages and partial commutations
- Strongly locally testable semigroups with commuting idempotents and related 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 Q4077455)