Pages that link to "Item:Q1575558"
From MaRDI portal
The following pages link to Families of locally testable languages (Q1575558):
Displaying 20 items.
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- On generalized locally testable languages (Q760215) (← links)
- Languages and scanners (Q1177931) (← links)
- LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
- Right and left locally testable languages (Q1583588) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- A new algorithm for testing if a regular language is locally threshold testable (Q2380003) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- Some variations on the notion of locally testable language (Q2709036) (← links)
- From regular to strictly locally testable languages (Q2789519) (← links)
- From regular to strictly locally testable languages (Q2841978) (← links)
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES (Q3021987) (← links)
- (Q4964807) (← links)
- (Q5016361) (← links)
- Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
- STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES (Q5401553) (← links)
- On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata (Q5500690) (← links)
