Optimal estimation on the order of local testability of finite automata

DOI10.1016/S0304-3975(99)00017-1zbMath0951.68059arXiv2011.06253OpenAlexW2078077191MaRDI QIDQ1575894

A. N. Trahtman

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.06253

zbMATH Keywords

locally testable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (1)

SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The varieties of n-testable semigroups
• On the bound of the synchronization delay of a local automaton
• Locally testable semigroups
• Locally testable languages
• Characterizations of locally testable events
• Regular locally testable semigroups as semigroups of quasi-ideals
• Computing the Order of a Locally Testable Automaton
• A polynomial time algorithm for the local testability problem of deterministic finite automata
• Lower Bound of the Number of Threshold Functions
• The Theory of Definite Automata

This page was built for publication: Optimal estimation on the order of local testability of finite automata