scientific article; zbMATH DE number 3495598

Cited in

(only showing first 100 items - show all)

Efficient Reconstruction of RC-Equivalent Strings
Regular languages and partial commutations
On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
Schreier split extensions of preordered monoids
Geometric grid classes of permutations
Representations of relatively free profinite semigroups, irreducibility, and order primitivity
Computing finite semigroups
The join of the pseudovarieties of $\mathcal R$-trivial and $\mathcal L$-trivial monoids
Some results onC-varieties
One quantifier alternation in first-order logic with modular predicates
On dot-depth two
Pointlike sets and separation: a personal perspective
On Arch Factorization and Subword Universality for Words and Compressed Words
Testing Simon's congruence
scientific article; zbMATH DE number 7561705 (Why is no real title available?)
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
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
Exponentially more concise quantum recognition of non-RMM regular languages
Implicit operations on finite ${\mathcal J}$-trivial semigroups and a conjecture of I. Simon
Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
String inference from longest-common-prefix array
Nearly $k$-universal words -- investigating a part of Simon's congruence
State complexity of permutation and related decision problems on alphabetical pattern constraints
All about unambiguous polynomial closure
A Note on Decidable Separability by Piecewise Testable Languages
Bilateral locally testable languages.
Some complexity results for polynomial rational expressions.
Languages of R-trivial monoids
On power commutative semigroups
scientific article; zbMATH DE number 7577578 (Why is no real title available?)
Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
Games, equations and dot-depth two monoids
On a conjecture concerning dot-depth two languages
Representation theory of finite semigroups, semigroup radicals and formal language theory
The power of programs over monoids in DA
The dot-depth hierarchy of star-free languages is infinite
Subsequence versus substring constraints in sequence pattern languages
Some results on the dot-depth hierarchy
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
Syntactic semigroup problem for the semigroup reducts of affine near-semirings over Brandt semigroups.
Theme and variations on the concatenation product
Separating regular languages with two quantifier alternations
Strongly locally testable semigroups with commuting idempotents and related languages
On upper and lower bounds on the length of alternating towers
Learning in the limit with lattice-structured hypothesis spaces
scientific article; zbMATH DE number 3892608 (Why is no real title available?)
Longest Common Subsequence with Gap Constraints
Absent subsequences in words
On the index of Simon's congruence for piecewise testability
On Boolean combinations forming piecewise testable languages
Computing the $k$-binomial complexity of the Thue-Morse word
Inverse monoids of dot-depth two
On Shuffle Ideals
Approximate comparison of functions computed by distance automata
Regular languages of thin trees
Ranking and Unranking k-Subsequence Universal Words
Characterization of the pseudovariety generated by finite monoids satisfying $\mathcal R=\mathcal H$.
Canonical finite models of Kleene algebra with tests
Products of languages with counter
Covering and separation for logical fragments with modular predicates
The word problem for omega-terms over the Trotter-Weil hierarchy
Well quasi-orders and regular languages
Forbidden patterns for ordered automata
Inclusion relations between some congruences related to the dot-depth hierarchy
Varieties
Syntaktische Monoide und Hypercodes
On the word problem for syntactic monoids of piecewise testable languages.
Efficient algorithms for membership in Boolean hierarchies of regular languages
Injective envelopes of transition systems and Ferrers languages
Free profinite R-trivial, locally idempotent and locally commutative semigroups
The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
Separating Without Any Ambiguity.
Over testable languages
Subsequences in bounded ranges: matching and analysis problems
Trees, congruences and varieties of finite semigroups
A linear algorithm for string reconstruction in the reverse complement equivalence model
Reconstructing Words from Right-Bounded-Block Words
Generic results for concatenation hierarchies
First-order logic and its infinitary quantifier extensions over countable words
The product of rational languages
The half-levels of the $\mathrm {FO}_2$ alternation hierarchy
On finite $\mathcal J$-trivial monoids
An Algebraic Characterization of Strictly Piecewise Languages
Polynomial operations and hierarchies of concatenation
Non-finitely based monoids.
First-order separation over countable ordinals
On the Simon's congruence neighborhood of languages
Finite-automaton aperiodicity is PSPACE-complete
On Simon's congruence closure of a string
A sufficient condition to polynomially compute a minimum separating DFA
Variétés de langages et monoide des parties
Block-Groups and Hall Relations
scientific article; zbMATH DE number 7559472 (Why is no real title available?)
Algebraic tools for the concatenation product.
Factorization Forests
Alternation hierarchies of first order logic with regular predicates
Absent Subsequences in Words
Characterizations of some classes of regular events
Matching patterns with variables under Simon's congruence

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)