000 | 04796nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-45007-8 | ||
003 | DE-He213 | ||
005 | 20240423132522.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540450078 _9978-3-540-45007-8 |
||
024 | 7 |
_a10.1007/3-540-45007-6 _2doi |
|
050 | 4 | _aQA267-268.5 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aDevelopments in Language Theory _h[electronic resource] : _b7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings / _cedited by Zoltán Ésik, Zoltán Fülöp. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aXI, 436 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2710 |
|
505 | 0 | _aInvited 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. | |
520 | _a 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 current aspects in language theory are addressed, in particular grammars, acceptors, and transducers for strings, trees, graphs, arrays, etc; algebraic theories for automata and languages; combinatorial properties of words and languages; formal power series; decision problems; efficient algorithms for automata and languages; and relations to complexity theory and logic, picture description and analysis, DNA computing, quantum computing, cryptography, and concurrency. | ||
650 | 0 | _aMachine theory. | |
650 | 0 | _aSocial sciences. | |
650 | 0 | _aHumanities. | |
650 | 0 | _aComputer science. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aHumanities and Social Sciences. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aÉsik, Zoltán. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aFülöp, Zoltán. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540404347 |
776 | 0 | 8 |
_iPrinted edition: _z9783662197844 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2710 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45007-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188651 _d188651 |