The following pages link to Languages and scanners (Q1177931):
Displaying 15 items.
- Subshifts as models for MSO logic (Q384929) (← links)
- Which security policies are enforceable by runtime monitors? A survey (Q465692) (← links)
- Regular languages and Stone duality (Q675860) (← links)
- Locally commutative power semigroups and counting factors of words (Q685456) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Over testable languages (Q1351950) (← links)
- Families of locally testable languages (Q1575558) (← links)
- LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
- Right and left locally testable languages (Q1583588) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Bilateral locally testable languages. (Q1874423) (← links)
- Automata on finite trees (Q2074209) (← 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)
