Sciweavers

13306 search results - page 193 / 2662
» Theoretical Computer Science
Sort
View
DLT
2009
15 years 4 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
132
Voted
ITICSE
1999
ACM
15 years 10 months ago
Thinking parallel: the process of learning concurrency
Mordechai Ben-Ari, Yifat Ben-David Kolikant
128
Voted
RTA
1999
Springer
15 years 10 months ago
TOY: A Multiparadigm Declarative System
Francisco Javier López-Fraguas, Jaime S&aac...
SOFSEM
2005
Springer
15 years 12 months ago
Cost-Constrained Minimum-Delay Multicasting
Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno
MFCS
2001
Springer
15 years 10 months ago
Rational Graphs Trace Context-Sensitive Languages
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
Christophe Morvan, Colin Stirling