759 search results - page 34 / 152 » Overlap-Free Regular Languages |
HYBRID
1998
Springer
14 years 22 days ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
ECHT
1992
14 years 18 days ago
1992
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
ICTAC
2007
Springer
14 years 2 months ago
2007
Springer
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
DLT
2009
13 years 6 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1