LEADER 05599nam 22007455 450 001 996466155003316 005 20200630030318.0 010 $a3-540-45007-6 024 7 $a10.1007/3-540-45007-6 035 $a(CKB)1000000000212061 035 $a(SSID)ssj0000322561 035 $a(PQKBManifestationID)11243985 035 $a(PQKBTitleCode)TC0000322561 035 $a(PQKBWorkID)10288791 035 $a(PQKB)11415206 035 $a(DE-He213)978-3-540-45007-8 035 $a(MiAaPQ)EBC3072488 035 $a(PPN)15516872X 035 $a(EXLCZ)991000000000212061 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings /$fedited by Zoltán Ésik, Zoltán Fülöp 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XI, 436 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2710 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40434-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2710 606 $aMathematical logic 606 $aComputers 606 $aComputer logic 606 $aComputer science?Mathematics 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aScience, Humanities and Social Sciences, multidisciplinary$3https://scigraph.springernature.com/ontologies/product-market-codes/A11007 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aMathematical logic. 615 0$aComputers. 615 0$aComputer logic. 615 0$aComputer science?Mathematics. 615 14$aMathematical Logic and Formal Languages. 615 24$aScience, Humanities and Social Sciences, multidisciplinary. 615 24$aComputation by Abstract Devices. 615 24$aLogics and Meanings of Programs. 615 24$aDiscrete Mathematics in Computer Science. 676 $a511.3 702 $aÉsik$b Zoltán$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFülöp$b Zoltán$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Developments in Language Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466155003316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA