Sciweavers

759 search results - page 32 / 152
» Odometers on Regular Languages
Sort
View
JUCS
2002
108views more  JUCS 2002»
14 years 9 months ago
Heyting Algebras and Formal Languages
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
DLT
1993
14 years 11 months ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
14 years 10 months ago
Some Grammatical Structures of Programming Languages as Simple Bracketed Languages
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...
Boris Melnikov, Elena Kashlakova
JUCS
2010
129views more  JUCS 2010»
14 years 8 months ago
Orthogonal Concatenation: Language Equations and State Complexity
: 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...
Mark Daley, Michael Domaratzki, Kai Salomaa
CONCUR
2004
Springer
15 years 3 months ago
The Pros and Cons of Netcharts
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 ...
Nicolas Baudru, Rémi Morin