1052 search results - page 94 / 211 » The Regular Real-Time Languages |
124
click to vote
FSTTCS
2010
Springer
15 years 1 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...
156
click to vote
DLT
2009
15 years 1 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
162
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
127
Voted
DLT
2007
15 years 5 months ago
2007
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
127
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...