Bilateral locally testable languages

Authors:
Pedro García;José Ruiz;Manuel Vazquez de Parga
Affiliations:
Depto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Depto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Depto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
Theoretical Computer Science
Year:
2003

Citing 9
Cited 0

Characterization of idempotent transformation monoids

Information Processing Letters
Languages and scanners

Theoretical Computer Science
Finite automata, formal logic, and circuit complexity

Finite automata, formal logic, and circuit complexity
Over testable languages

Theoretical Computer Science
Right and left locally testable languages

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Piecewise testable events

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give an algebraic characterization of a new variety of languages that will be called bilateral locally testable languages and denoted as BLT. Given k 0, the membership of a word x to a BLT (k-BT) language can be decided by means of exploring the segments of length k of x, as well as considering the order of appearance of those segments when we scan the prefixes and the suffixes of x. In this paper, we also characterize the syntactic semigroup of BLT languages in terms of the equations of the variety they belong to, as well as in terms of the join of two previously studied varieties.