The following pages link to STACS 2005 (Q5710686):
Displaying 10 items.
- Aural pattern recognition experiments and the subregular hierarchy (Q438585) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- A note on the characterization of TL [EF] (Q845961) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- Algebra for Infinite Forests with an Application to the Temporal Logic EF (Q3184670) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- Games for Temporal Logics on Trees (Q3602814) (← links)
- Weak Separation Problem for Tree Languages (Q5859635) (← links)
