JUCS

2002

13 years 8 months ago
2002

: 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...

ENTCS

2002

13 years 8 months ago
2002

Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...

CORR

2006

Springer

13 years 9 months ago
2006

Springer

We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...

ACTA

2006

13 years 9 months ago
2006

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...

COLING

1990

13 years 10 months ago
1990

Mandarin Chinese is a highly flexible and context-sensitive language. It is difficult to do the case marking and index assignment during the parsing of Chinese sentences. This pap...

BIRTHDAY

1999

Springer

14 years 1 months ago
1999

Springer

This review paper will report on some recent discoveries in the area of Formal Languages, chie y by F. Otto, G. Buntrock and G. Niemann. These discoveries have pointed out certain ...

MFCS

2001

Springer

14 years 1 months ago
2001

Springer

This paper shows that the traces of rational graphs coincide with the context-sensitive languages.

MFCS

2007

Springer

14 years 3 months ago
2007

Springer

In formal language theory, many families of languages are deﬁned using grammars or ﬁnite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...