The following pages link to Symbolic finite state transducers (Q2942866):
Displaying 17 items.
- Using finite transducers for describing and synthesising structural time-series constraints (Q265697) (← links)
- Foundations of Boolean stream runtime verification (Q278752) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Symbolic tree automata (Q483051) (← links)
- Extended symbolic finite automata and transducers (Q746776) (← links)
- Invariants for time-series constraints (Q823762) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Formalising and implementing Boost POSIX regular expression matching (Q2220787) (← links)
- Automata-based symbolic string analysis for vulnerability detection (Q2248096) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Static Analysis of Communicating Processes Using Symbolic Transducers (Q2961555) (← links)
- Equivalence of Finite-Valued Symbolic Finite Transducers (Q3179179) (← links)
- Semantic Foundations for Deterministic Dataflow and Stream Processing (Q5041103) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- On the Model Checking Problem for Some Extension of CTL* (Q5060078) (← links)
- Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels (Q5859660) (← links)
