Pages that link to "Item:Q2558849"
From MaRDI portal
The following pages link to Characterizations of locally testable events (Q2558849):
Displaying 50 items.
- Conjugacy languages in groups (Q273099) (← links)
- Canonical finite models of Kleene algebra with tests (Q299196) (← links)
- Categories as algebra: An essential ingredient in the theory of monoids (Q581545) (← links)
- The varieties of n-testable semigroups (Q594200) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Equations and dot-depth one (Q688972) (← links)
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- On generalized locally testable languages (Q760215) (← links)
- On semidirect products of two finite semilattices (Q786232) (← links)
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. (Q869222) (← links)
- Products of languages with counter (Q917324) (← links)
- On bases of identities for the \(\omega\)-variety generated by locally testable semigroups. (Q935166) (← links)
- A property of the Schützenberger product (Q1089109) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- Languages and scanners (Q1177931) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- The Burnside problem for semigroups (Q1215588) (← links)
- A generalization of finiteness (Q1236192) (← links)
- Properties of code events and homomorphisms over regular events (Q1237764) (← links)
- La finitude des représentations linéaires des semi-groupes est decidable (Q1245319) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices (Q1250142) (← links)
- Semidirect products of pseudovarieties from the universal algebraist's point of view (Q1262958) (← links)
- Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups (Q1293384) (← links)
- Equations on the semidirect product of a finite semilattice by a finite commutative monoid (Q1328448) (← links)
- Over testable languages (Q1351950) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Profinite categories and semidirect products (Q1380025) (← links)
- Biinfinite words with maximal recurrent unbordered factors. (Q1401214) (← links)
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334) (← links)
- Families of locally testable languages (Q1575558) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
- LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
- Right and left locally testable languages (Q1583588) (← links)
- Left and right negatively orderable semigroups and a one-sided version of Simon's theorem (Q1644738) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Bilateral locally testable languages. (Q1874423) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
