Add to ORKGAll in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately
The first part of the thesis concerns problems related to the question: "when can a regular tre...
We study the expressive power of linear propositional temporal logic interpreted on finite sequences...
We present a framework for obtaining effective characterizations of simplefragments of future tempor...
Abstract. In a data word or a data tree each position carries a label from a finite alphabet and a d...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Let TLXF TLF be the class of formulas of temporal logic, where as the only tem-poral operatorsX (n...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
AbstractWe use the cascade product of tree automata to give an algebraic characterization of the exp...
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal langu...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
AbstractIn the last decade Alur and Dill introduced a model of automata on timed ω-sequences which e...
AbstractTree-walking automata (TWAs) recently received new attention in the fields of formal languag...
Finite tree automata on infinite trees which move from the root infinitely are investigated through ...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
We study the expressive power of linear propositional temporal logic interpreted on finite sequences...
We present a framework for obtaining effective characterizations of simplefragments of future tempor...
Abstract. In a data word or a data tree each position carries a label from a finite alphabet and a d...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Let TLXF TLF be the class of formulas of temporal logic, where as the only tem-poral operatorsX (n...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
AbstractWe use the cascade product of tree automata to give an algebraic characterization of the exp...
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal langu...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
AbstractIn the last decade Alur and Dill introduced a model of automata on timed ω-sequences which e...
AbstractTree-walking automata (TWAs) recently received new attention in the fields of formal languag...
Finite tree automata on infinite trees which move from the root infinitely are investigated through ...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
We study the expressive power of linear propositional temporal logic interpreted on finite sequences...
We present a framework for obtaining effective characterizations of simplefragments of future tempor...