Pages that link to "Item:Q2841978"
From MaRDI portal
The following pages link to FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES (Q2841978):
Displaying 7 items.
- Reducing local alphabet size in recognizable picture languages (Q832926) (← links)
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages (Q2112173) (← links)
- Homomorphic characterization of tree languages based on comma-free encoding (Q2232286) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes (Q2676458) (← links)
- STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES (Q5401553) (← links)
- Regular languages as images of local functions over small alphabets (Q6647748) (← links)
