The following pages link to Timos Antonopoulos (Q269324):
Displayed 11 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Reachability problems for Markov chains (Q477610) (← links)
- Three Variables Suffice for Real-Time Logic (Q2949451) (← links)
- Separating Graph Logic from MSO (Q3617721) (← links)
- Query Learning of Derived Omega-Tree Languages in Polynomial Time (Q5111177) (← links)
- (Q5232903) (← links)
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (Q5410687) (← links)
- (Q5874193) (← links)
- A formal analysis of timing channel security via bucketing (Q6091327) (← links)
- Representing regular languages of infinite words using mod 2 multiplicity automata (Q6141755) (← links)