scientific article; zbMATH DE number 1839456

zbMath0999.68519MaRDI QIDQ4782722

A. N. Trahtman

Publication date: 2 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380347

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmtransition graphautomatonsyntactic semigrouppiecewise testablelocally testablelocally threshold testable

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

On Boolean combinations forming piecewise testable languages ⋮ On the Complexity of k-Piecewise Testability and the Depth of Automata ⋮ On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs ⋮ Unnamed Item ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ Reducing the time complexity of testing for local threshold testability ⋮ Unnamed Item

Uses Software

• LANGAGE

This page was built for publication: