Sciweavers

DLT
2003
14 years 1 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
DLT
2003
14 years 1 months ago
Tile Rewriting Grammars
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...
Stefano Crespi-Reghizzi, Matteo Pradella
DLT
2003
14 years 1 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
DLT
2003
14 years 1 months ago
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
Markus Holzer, Barbara König
DLT
2003
14 years 1 months ago
Computation with Absolutely No Space Overhead
Lane A. Hemaspaandra, Proshanto Mukherji, Till Tan...
DLT
2003
14 years 1 months ago
On a Conjecture of Schnoebelen
The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set ...
Antonio Cano Gómez, Jean-Eric Pin
DLT
2003
14 years 1 months ago
On Three Classes of Automata-Like P Systems
Rudolf Freund, Carlos Martín-Vide, Adam Obt...
DLT
2003
14 years 1 months ago
On Well Quasi-orders on Languages
Flavio D'Alessandro, Stefano Varricchio