The following pages link to Locally testable languages (Q2554236):
Displayed 29 items.
- The varieties of n-testable semigroups (Q594200) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. (Q869222) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Series formelles et algèbres syntactiques (Q1144951) (← 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)
- Classes of formal grammars (Q1248342) (← links)
- Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups (Q1293384) (← links)
- Over testable languages (Q1351950) (← links)
- Families of locally testable languages (Q1575558) (← 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)
- Bilateral locally testable languages. (Q1874423) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Locally testable semigroups (Q2264860) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- Smoothing and compression with stochastic \(k\)-testable tree languages (Q2485083) (← links)
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data (Q2508967) (← links)
- Characterizations of locally testable events (Q2558849) (← links)
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA (Q3056279) (← links)
- Group-complexity and reversals of finite semigroups (Q4106789) (← links)
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY (Q4111346) (← links)
- Strongly locally testable semigroups with commuting idempotents and related languages (Q4256142) (← links)
- Identities of locally testable semigroups (Q4700477) (← links)
- Algebraic decision procedures for local testability (Q4773689) (← links)
- Free profinite locally idempotent and locally commutative semigroups (Q5946464) (← links)