20 search results - page 1 / 4 » Shuffle Decomposition of Regular Languages |
JUCS
2002
13 years 7 months ago
2002
CORR
2008
Springer
13 years 7 months ago
2008
Springer
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
IANDC
2010
13 years 4 months ago
2010
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
DLT
2006
13 years 8 months ago
2006
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...