Forgetting automata and context-free languages Petr JančarFrantišek MrázMartin Plátek OriginalPaper Pages: 409 - 420
Algebraic models of microprocessors architecture and organisation N. A. HarmanJ. V. Tucker OriginalPaper Pages: 421 - 456
Syntactic complexity of context-free grammars over word monoids Alexander Meduna OriginalPaper Pages: 457 - 462
Category-based modularisation for equational logic programming Răzvan Diaconescu OriginalPaper Pages: 477 - 510
A kernel language for programmed rewriting of (hyper)graphs Andrea Maggiolo-SchettiniJózef Winkowski OriginalPaper Pages: 523 - 546
On the recognition of permuted Supnick and incomplete Monge matrices Vladimir DeinekoRüdiger RudolfGerhard J. Woeginger OriginalPaper Pages: 559 - 569
The linear landscape of external contextual languages Andrzej EhrenfeuchtGheorghe PăunGrzegorz Rozenberg OriginalPaper Pages: 571 - 593
Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems M. R. K. Krishna Rao OriginalPaper Pages: 595 - 606
Parallel integer sorting and simulation amongst CRCW models Sanjeev Saxena OriginalPaper Pages: 607 - 619
An observation on suffix redundancy in LL(1) error repair Eberhard Bertsch OriginalPaper Pages: 631 - 639
Axiomatizing the algebra of net computations and processes Pierpaolo DeganoJosé MeseguerUgo Montanari OriginalPaper Pages: 641 - 667
On the sequential nature of interprocedural program-analysis problems Thomas Reps OriginalPaper Pages: 739 - 757
A direct complement construction forLR(1) grammars Stephan Heilbrunner OriginalPaper Pages: 781 - 797
