scientific article; zbMATH DE number 1962781

zbMath1033.68071arXiv2011.04236MaRDI QIDQ4418616

A. N. Trahtman

Publication date: 11 August 2003

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

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

zbMATH Keywords

algorithmgraphsemigrouplanguagedeterministic finite automatonlocally testable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Execution monitoring enforcement under memory-limitation constraints ⋮ Reducing the time complexity of testing for local threshold testability

This page was built for publication: