Pages that link to "Item:Q4773689"
From MaRDI portal
The following pages link to Algebraic decision procedures for local testability (Q4773689):
Displayed 50 items.
- The varieties of n-testable semigroups (Q594200) (← links)
- The expressivity of autosegmental grammars (Q667923) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- On generalized locally testable languages (Q760215) (← 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)
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages (Q1009259) (← 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)
- Languages and scanners (Q1177931) (← links)
- The Burnside problem for semigroups (Q1215588) (← 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)
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices (Q1250142) (← links)
- Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups (Q1293384) (← links)
- Over testable languages (Q1351950) (← links)
- Biinfinite words with maximal recurrent unbordered factors. (Q1401214) (← links)
- Families of locally testable languages (Q1575558) (← 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)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← 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)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- String assembling systems: comparison to sticker systems and decidability (Q2152089) (← links)
- Measuring power of locally testable languages (Q2164008) (← links)
- Locally testable semigroups (Q2264860) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Locally testable languages (Q2554236) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA (Q3056279) (← links)
- GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE (Q3528858) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- (Q3877877) (← links)
- Group-complexity and reversals of finite semigroups (Q4106789) (← links)
- Strongly locally testable semigroups with commuting idempotents and related languages (Q4256142) (← links)
- (Q4580330) (← links)
- The product of rational languages (Q4630281) (← links)
- TAMENESS OF THE PSEUDOVARIETY <b>LS1</b> (Q4658703) (← links)
- The globals of pseudovarieties of ordered semigroups containing<i>B</i><sub>2</sub>and an application to a problem proposed by Pin (Q4680724) (← links)
- TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES (Q4902679) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q5041265) (← links)