Developments in language theory : 7th international conference, DLT 2003, Szeged, Hungary, July 7-11, 2003 : proceedings
This book constitutes the refereed proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003, held in Szeged, Hungary, in July 2003. The 27 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 57 submissions. All cu...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
2710 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Developments in language theory, 7th international conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, proceedings, Zoltán Ésik, Zoltán Fülöp (eds.), Berlin, Springer, 2003, 1 vol. (XI-436 p.), Lecture notes in computer science, 3-540-40434-1 • Developments in Language Theory, Texte imprimé, 9783662197844 |
جدول المحتويات:
- Invited Presentations
- Quantum Computing: 1-Way Quantum Automata
- An Automata-Theoretic Approach to Software Verification
- Comments on Complete Sets of Tree Automata
- On a Conjecture of Schnoebelen
- Restarting Automata and Their Relations to the Chomsky Hierarchy
- Test Sets for Large Families of Languages
- Complexity Theory Made Easy
- Contributions
- Synchronizing Monotonic Automata
- Covering Problems from a Formal Language Point of View
- Regular Languages Generated by Reflexive Finite Splicing Systems
- The Myhill-Nerode Theorem for Recognizable Tree Series
- Generating Series of the Trace Group
- Residual Finite Tree Automata
- From Glushkov WFAs to Rational Expressions
- NFA Reduction Algorithms by Means of Regular Inequalities
- Tile Rewriting Grammars
- Distributed Pushdown Automata Systems: Computational Power
- On Well Quasi-orders on Languages
- Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models
- On Enumeration of Müller Automata
- Branching Grammars: A Generalization of ET0L Systems
- Learning a Regular Tree Language from a Teacher
- On Three Classes of Automata-Like P Systems
- Computing Languages by (Bounded) Local Sets
- About Duval s Conjecture
- Computation with Absolutely No Space Overhead
- Deleting String Rewriting Systems Preserve Regularity
- On Deterministic Finite Automata and Syntactic Monoid Size, Continued
- Flip-Pushdown Automata: Nondeterminism is Better than Determinism
- Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton
- Minimizing Finite Automata Is Computationally Hard
- Boolean Grammars
- Syntactic Semiring and Universal Automaton
- Alphabetic Pushdown Tree Transducers.