On generalized locally testable languages
From MaRDI portal
Publication:760215
DOI10.1016/0012-365X(84)90045-1zbMATH Open0554.68056OpenAlexW2015342864MaRDI QIDQ760215FDOQ760215
Authors: Janusz Brzozowski, Faith E. Fich 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90045-1
Recommendations
- Some variations on the notion of locally testable language
- From regular to strictly locally testable languages
- From regular to strictly locally testable languages
- Families of locally testable languages
- On two-sided locally testable languages
- scientific article; zbMATH DE number 2050939
- scientific article; zbMATH DE number 1507233
- Two-Sided Strictly Locally Testable Languages
- On separation by locally testable and locally threshold testable languages
- Measuring power of locally testable languages
Cites Work
Cited In (15)
- A Testing Theory for a Higher-Order Cryptographic Language
- Fragments of first-order logic over infinite words
- Title not available (Why is that?)
- Profinite categories and semidirect products
- On a conjecture concerning dot-depth two languages
- Strongly locally testable semigroups with commuting idempotents and related languages
- Some results on the dot-depth hierarchy
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
- Right and left strongly locally testable semigroups and languages
- Local testability from words to traces, a suitable definition
- Two-Sided Strictly Locally Testable Languages
- Complete κ-reducibility of pseudovarieties of the form DRH
- Locally countable pseudovarieties
- Graph congruences and pair testing
- On separation by locally testable and locally threshold testable languages
This page was built for publication: On generalized locally testable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760215)
