scientific article; zbMATH DE number 3495598
From MaRDI portal
Publication:4077455
zbMath0316.68034MaRDI QIDQ4077455
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item, Strongly locally testable semigroups with commuting idempotents and related languages, Scattered Factor-Universality of Words, Reconstructing Words from Right-Bounded-Block Words, A Survey on Difference Hierarchies of Regular Languages, Polynomial closure and unambiguous product, On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs, On Upper and Lower Bounds on the Length of Alternating Towers, Unnamed Item, Alternation Hierarchies of First Order Logic with Regular Predicates, A Note on Decidable Separability by Piecewise Testable Languages, Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$, On the Simon's congruence neighborhood of languages, Absent Subsequences in Words, State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, Conelikes and ranker comparisons, How many times do you need to go back to the future in unary temporal logic?, Ranking and Unranking k-Subsequence Universal Words, Longest Common Subsequence with Gap Constraints, On Arch Factorization and Subword Universality for Words and Compressed Words, Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups, Subsequences in bounded ranges: matching and analysis problems, First-order separation over countable ordinals, The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies, Unnamed Item, Measuring power of generalised definite languages, Simon's congruence pattern matching, Hierarchies of Piecewise Testable Languages, Unnamed Item, The product of rational languages, Injective envelopes of transition systems and Ferrers languages, Separating Without Any Ambiguity., Efficient Reconstruction of RC-Equivalent Strings, An Algebraic Characterization of Strictly Piecewise Languages, Theme and Variations on the Concatenation Product, The pseudovariety $J$ is hyperdecidable, On Rough Approximations of Languages under Infinite Index Indiscernibility Relations, Unnamed Item, Nearly \(k\)-universal words -- investigating a part of Simon's congruence, On Shuffle Ideals, On Simon's congruence closure of a string, On dot-depth two, The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin, The pseudovariety of semigroups of triangular matrices over a finite field, Some results onC-varieties, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Representation theory of finite semigroups, semigroup radicals and formal language theory, Unnamed Item, Computing the \(k\)-binomial complexity of the Thue-Morse word, Representations of relatively free profinite semigroups, irreducibility, and order primitivity, Unnamed Item, Unnamed Item, Separating regular languages with two quantifier alternations, Factorization Forests, Unnamed Item, The Quantifier Alternation Hierarchy of Synchronous Relations, The Power of Programs over Monoids in DA, One quantifier alternation in first-order logic with modular predicates, Geometric grid classes of permutations, Unnamed Item, On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids, Block-Groups and Hall Relations, Reconstructing Words from Right-Bounded-Block Words, A conjecture on the concatenation product, On Boolean combinations forming piecewise testable languages, Some complexity results for polynomial rational expressions., Bilateral locally testable languages., Characterizations of some classes of regular events, Pointlike sets and separation: a personal perspective, Approximate comparison of functions computed by distance automata, Regular languages of thin trees, Well quasi-orders and regular languages, Canonical finite models of Kleene algebra with tests, Characterization of the pseudovariety generated by finite monoids satisfying \(\mathcal R=\mathcal H\)., Efficient algorithms for membership in Boolean hierarchies of regular languages, First-order logic and its infinitary quantifier extensions over countable words, The word problem for omega-terms over the Trotter-Weil hierarchy, Over testable languages, Monoids respecting \(n\)-chains of intervals, Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words), Polynomial closure and unambiguous product, The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups, Membership testing in commutative transformation semigroups, Semigroups and languages of dot-depth two, Partially ordered finite monoids and a theorem of I. Simon, Identities of the stylic monoid, Measuring power of locally testable languages, Learning from positive and negative examples: dichotomies and parameterized algorithms, Inclusion relations between some congruences related to the dot-depth hierarchy, Inverse monoids of dot-depth two, The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy, Regular languages and partial commutations, A proof of Simon's theorem on piecewise testable languages, On finite \(\mathcal J\)-trivial monoids, The finite basis problem for Kiselman monoids., Series formelles et algèbres syntactiques, Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata., Languages of R-trivial monoids, Variétés de langages et monoide des parties, Alternating complexity of counting first-order logic for the subword order, Separability by piecewise testable languages is \textsc{PTime}-complete, A generalization of the Schützenberger product of finite monoids, Absent subsequences in words, Classification of finite monoids: the language approach, Piecewise testable languages via combinatorics on words, On the varieties of languages associated with some varieties of finite monoids with commuting idempotents, On the word problem for syntactic monoids of piecewise testable languages., A linear algorithm for string reconstruction in the reverse complement equivalence model, Products of languages with counter, Exponentially more concise quantum recognition of non-RMM regular languages, 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, Polynomial operations and hierarchies of concatenation, Normal forms under Simon's congruence, The expressivity of autosegmental grammars, On power commutative semigroups, The dual equivalence of equations and coequations for automata, Finite basis problem for involution monoids of unitriangular Boolean matrices, Kernel methods for learning languages, Behavior of digital sequences through exotic numeration systems, On a conjecture concerning dot-depth two languages, Games, equations and dot-depth two monoids, Computing finite semigroups, Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids, Some results on the dot-depth hierarchy, Finite semigroup varieties of the form V*D, Learning in the limit with lattice-structured hypothesis spaces, Subsequence versus substring constraints in sequence pattern languages, Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon, A generalization of finiteness, Syntaktische Monoide und Hypercodes, A sufficient condition to polynomially compute a minimum separating DFA, The dot-depth hierarchy of star-free languages is infinite, Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data, Schreier split extensions of preordered monoids, 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\)., Syntactic semigroup problem for the semigroup reducts of affine near-semirings over Brandt semigroups, Quantifier Alternation for Infinite Words, Non-finitely based monoids., 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, Logic, semigroups and automata on words, Generic results for concatenation hierarchies, Games, equations and the dot-depth hierarchy, Varieties, An efficient null-free procedure for deciding regular language membership, LANGAGE: A Maple package for automaton characterization of regular languages, Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups, Constructing divisions into power groups, Right and left locally testable languages, Characterizing level one in group-based concatenation hierarchies, Algebraic tools for the concatenation product., Languages defined with modular counting quantifiers, Une généralisation des théorèmes de Higman et de Simon aux mots infinis, Equations and monoid varieties of dot-depth one and two, String inference from longest-common-prefix array, Finite-automaton aperiodicity is PSPACE-complete, 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, On a complete set of generators for dot-depth two
