426 search results - page 6 / 86 » Synchronization of Regular Automata |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
FSTTCS
2010
Springer
13 years 5 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...
FSTTCS
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
HYBRID
1998
Springer
13 years 12 months 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...
ACL
1997
13 years 9 months ago
1997
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...