1052 search results - page 66 / 211 » The Regular Real-Time Languages |
115
click to vote
INFORMATICALT
2000
15 years 3 months ago
2000
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
121
Voted
JUCS
2010
15 years 2 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
117
Voted
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
126
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
132
Voted
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...