000 05135nam a22006255i 4500
001 978-3-540-45089-4
003 DE-He213
005 20240423132501.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540450894
_9978-3-540-45089-4
024 7 _a10.1007/3-540-45089-0
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aImplementation and Application of Automata
_h[electronic resource] :
_b8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings /
_cedited by Oscar H. Ibarra, Zhe Dang.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aXI, 312 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 ;
_v2759
505 0 _aInvited Lectures -- Automata for Specifying Component Interfaces -- Automata on Words -- Regular Papers -- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications -- Timing Parameter Characterization of Real-Time Systems -- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata -- From Regular Weighted Expressions to Finite Automata -- Bideterministic Automata and Minimal Representations of Regular Languages -- Succinct Descriptions of Regular Languages with Binary ?-NFAs -- An Efficient Pre-determinization Algorithm -- Introducing Vaucanson -- WFSC — A New Weighted Finite State Compiler -- Ternary Directed Acyclic Word Graphs -- Running Time Complexity of Printing an Acyclic Automaton -- Reducing the Time Complexity of Testing for Local Threshold Testability -- Branching Automata with Costs — A Way of Reflecting Parallelism in Costs -- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations -- TCTL Inevitability Analysis of Dense-Time Systems -- Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services -- Boolean Operations for Attribute-Element Constraints -- XML Schema Containment Checking Based on Semi-implicit Techniques -- Weak Minimization of DFA — An Algorithm and Applications -- Bag Automata and Stochastic Retrieval of Biomolecules in Solution -- An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics -- Robust Parsing Using Dynamic Programming -- LR Parsing for Global Index Languages (GILs) -- The Ehrenfeucht-Mycielski Sequence -- Poster Paper -- The Longest Common Subsequence Problem A Finite Automata Approach -- AVA: An Applet for Visualizing FRACTRAN and OtherAutomata -- Preliminary Experiments in Hardcoding Finite Automata -- Computational Linguistic Motivations for a Finite-State Machine Hierarchy -- The Effect of Rewriting Regular Expressions on Their Accepting Automata -- Building Context-Sensitive Parsers from CF Grammars with Regular Control Language -- Finite-State Molecular Computing.
520 _aAutomata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. In addition, there is a growing number of software systems designed to manipulate automata, regular expressions, grammars, and related structures. This volume contains 24 regular papers from the 8th International Conference on Implementation and Application of Automata (CIAA 2003) held in Santa Barbara, CA, USA, in July 2003 covering various topics in the theory, implementation, and application of automata and related structures. It also includes the abstracts of two invited lectures as well as the abstracts of the poster papers displayed during the conference.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 1 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aComputer Science.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aIbarra, Oscar H.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDang, Zhe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540405610
776 0 8 _iPrinted edition:
_z9783662183458
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2759
856 4 0 _uhttps://doi.org/10.1007/3-540-45089-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188251
_d188251