scientific article; zbMATH DE number 3495598
From MaRDI portal
Publication:4077455
zbMATH Open0316.68034MaRDI QIDQ4077455FDOQ4077455
Authors: Imre Simon 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Regular languages and partial commutations
- Schreier split extensions of preordered monoids
- Geometric grid classes of permutations
- Some results onC-varieties
- On dot-depth two
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- Pointlike sets and separation: a personal perspective
- Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- Exponentially more concise quantum recognition of non-RMM regular languages
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Languages of R-trivial monoids
- On power commutative semigroups
- Games, equations and dot-depth two monoids
- On a conjecture concerning dot-depth two languages
- The dot-depth hierarchy of star-free languages is infinite
- Subsequence versus substring constraints in sequence pattern languages
- 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.
- Some results on the dot-depth hierarchy
- On upper and lower bounds on the length of alternating towers
- Longest Common Subsequence with Gap Constraints
- Title not available (Why is that?)
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Learning in the limit with lattice-structured hypothesis spaces
- On the index of Simon's congruence for piecewise testability
- On Shuffle Ideals
- Approximate comparison of functions computed by distance automata
- Regular languages of thin trees
- Covering and separation for logical fragments with modular predicates
- Forbidden patterns for ordered automata
- Canonical finite models of Kleene algebra with tests
- Products of languages with counter
- Well quasi-orders and regular languages
- Varieties
- On the word problem for syntactic monoids of piecewise testable languages.
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- Trees, congruences and varieties of finite semigroups
- Generic results for concatenation hierarchies
- First-order logic and its infinitary quantifier extensions over countable words
- A linear algorithm for string reconstruction in the reverse complement equivalence model
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- An Algebraic Characterization of Strictly Piecewise Languages
- On finite \(\mathcal J\)-trivial monoids
- Polynomial operations and hierarchies of concatenation
- Non-finitely based monoids.
- Title not available (Why is that?)
- Finite-automaton aperiodicity is PSPACE-complete
- Variétés de langages et monoide des parties
- Algebraic tools for the concatenation product.
- Characterizations of some classes of regular events
- Semigroups and languages of dot-depth two
- Series formelles et algèbres syntactiques
- Equations and monoid varieties of dot-depth one and two
- Classification of finite monoids: the language approach
- Polynomial closure and unambiguous product
- A generalization of the Schützenberger product of finite monoids
- An efficient null-free procedure for deciding regular language membership
- Kernel methods for learning languages
- Monoids respecting \(n\)-chains of intervals
- Games, equations and the dot-depth hierarchy
- The finite basis problem for Kiselman monoids.
- Measuring power of locally testable languages
- Logic, semigroups and automata on words
- A generalization of finiteness
- Piecewise testable languages via combinatorics on words
- The pseudovariety $J$ is hyperdecidable
- Constructing divisions into power groups
- Reconstructing words from right-bounded-block words
- The dual equivalence of equations and coequations for automata
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- A conjecture on the concatenation product
- Finite semigroup varieties of the form V*D
- LANGAGE: A Maple package for automaton characterization of regular languages
- Partially ordered finite monoids and a theorem of I. Simon
- Membership testing in commutative transformation semigroups
- The covering problem
- A proof of Simon's theorem on piecewise testable languages
- Finite basis problem for involution monoids of unitriangular Boolean matrices
- Normal forms under Simon's congruence
- The expressivity of autosegmental grammars
- Behavior of digital sequences through exotic numeration systems
- Efficient Reconstruction of RC-Equivalent Strings
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity
- Computing finite semigroups
- One quantifier alternation in first-order logic with modular predicates
- On Arch Factorization and Subword Universality for Words and Compressed Words
- Testing Simon's congruence
- Title not available (Why is that?)
- All about unambiguous polynomial closure
- On shuffle products, acyclic automata and piecewise-testable languages
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- String inference from longest-common-prefix array
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- A Note on Decidable Separability by Piecewise Testable Languages
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- Title not available (Why is that?)
- Bilateral locally testable languages.
- Some complexity results for polynomial rational expressions.
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)
