Reducing the time complexity of testing for local threshold testability
From MaRDI portal
Publication:703505
DOI10.1016/j.tcs.2004.07.011zbMath1105.68068arXiv2011.06262MaRDI QIDQ703505
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.06262
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of locally testable languages
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- Graph congruences and wreath products
- Characterizations of locally testable events
- A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- Computing the Order of a Locally Testable Automaton
- A polynomial time algorithm for the local testability problem of deterministic finite automata
- Depth-First Search and Linear Graph Algorithms