From Regular to Strictly Locally Testable Languages

  title={From Regular to Strictly Locally Testable Languages},
  author={Stefano Crespi-Reghizzi and Pierluigi San Pietro},
  journal={Int. J. Found. Comput. Sci.},
A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the transition graph. Local languages are characterized by the value k = 2 of the sliding window width in the McNaughton and Papert's infinite hierarchy of strictly locally testable languages (k-slt). We generalize Medvedev's result in a new direction, studying… 

Regular Languages as Local Functions with Small Alphabets

By encoding the automaton computations using comma-free codes, it is proved that any regular language is the image computed by a length-preserving local function, which is defined on an alphabet that extends the terminal alphabet by just one additional letter.

Strict Local Testability with Consensus Equals Regularity

Using a recent generalization of Medvedev's homomorphic characterization of regular languages, it is proved that regular languages are exactly the consensual languages based on strictly locally testable sets, a result that hints at a novel parallel decomposition of finite automata into locallyTestable components.

Reducing the Local Alphabet Size in Tiling Systems for Picture Languages

This result lifts into 2D a known similar property of regular word languages, concerning the minimal alphabetic ratio needed to define a language by means of a projection of an SLT word language, using 2D comma-free codes, which have the property of synchronizability.

Reducing the local alphabet size in tiling systems by means of 2D comma-free codes

The result reproduces in two dimensions a similar property (known as Extended Medvedev’s theorem) of the regular word languages, concerning the minimal alphabetic ratio needed to define a language by means of a projection of an SLT word language.

Strict Local Testability with Consensus Equals Regularity, and Other Properties

It is shown that all and only the regular languages are consensually generated by a strictly locally testable base; the result is based on a generalization of Medvedev's homomorphic characterization of regular languages.

The Missing Case in Chomsky-Schützenberger Theorem

A new non-erasing variant of CST is presented that uses a Dyck alphabet independent from the grammar size and a regular language that is strictly-locally-testable, similarly to a recent generalization of Medvedev theorem for regular languages.

Implementation and Application of Automata

It is proved that the state complexity bounds that hold for arbitrary regular languages are also met by the languages Un(a, b, c) for union, intersection, difference, symmetric difference, product (concatenation) and star.

Consensual languages: a simple parallel machine model

It is shown that regular languages coincide with the consensual languages b ased on strictly locally testable computations, and a method for designing consensual languages so that t heir union is consensual is shown.

Non-erasing Chomsky-Sch{ü}tzenberger theorem with grammar-independent alphabet

On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages

This work investigates contextual grammars with strictly locally testable selection languages and compares those families to families which are based on monoidal, nilpotent, combinational, definite, suf fix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages.



Consensual languages and matching finite-state computations

Several conditions for a consensual definition to yield a regular language are presented, and it is shown that the size of a consensual specification of regular languages can be in a logarithmic ratio with respect to a DFA.

Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition

The proposed methods are illustrated through syntactic pattern recognition experiments in which a number of strings generated by ten given (source) non-k- TSSL grammars are used to infer ten k-TSSL stochastic automata, which are further used to classify newstrings generated by the same source Grammars.

Counter-Free Automata

A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed

Families of locally testable languages

  • Pascal Caron
  • Computer Science, Linguistics
    Theor. Comput. Sci.
  • 2000

Local Languages and the Berry-Sethi Algorithm

Aural Pattern Recognition Experiments and the Subregular Hierarchy

It is argued that experiments directed at distinguishing capabilities with respect to the Subregular Hierarchy, which subdivides the class of Regular stringsets, are likely to provide better evidence about the distinctions between the cognitive mechanisms of humans and those of other species.

Automata, languages, and machines. A

  • S. Eilenberg
  • Computer Science
    Pure and applied mathematics
  • 1974

History of the Theory of Numbers

THE third and concluding volume of Prof. Dickson's great work deals first with the arithmetical. theory of binary quadratic forms. A long chapter on the class-number is contributed by Mr. G. H.

Two-Dimensional Languages

The aim of this chapter is to generalize concepts and techniques of formal language theory to two dimensions. Informally, a two-dimensional string is called a picture and is defined as a rectangular