000 05648nam a22006015i 4500
001 978-3-540-76336-9
003 DE-He213
005 20240730181922.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540763369
_9978-3-540-76336-9
024 7 _a10.1007/978-3-540-76336-9
_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] :
_b12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers /
_cedited by Jan Holub, Jan Ždárek.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXIII, 326 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4783
505 0 _aInvited Talks -- Spiking Neural P Systems Used as Acceptors and Transducers -- Linear-Time Model Checking: Automata Theory in Practice -- OpenFst: A General and Efficient Weighted Finite-State Transducer Library -- Automata Applications in Chip-Design Software -- Contributed Talks -- Synchronizing Automata Preserving a Chain of Partial Orders -- Reducing Acyclic Cover Transducers -- On-the-Fly Stuttering in the Construction of Deterministic ?-Automata -- Average Value and Variance of Pattern Statistics in Rational Models -- Weighted Automata and Weighted Logics with Discounting -- Regulated Nondeterminism in Pushdown Automata -- Deterministic Caterpillar Expressions -- Backward and Forward Bisimulation Minimisation of Tree Automata -- An Implementation of Deterministic Tree Automata Minimization -- Accelerating Boyer Moore Searches on Binary Texts -- On the Suffix Automaton with Mismatches -- On String Matching in Chunked Texts -- Factor Automata of Automata and Applications -- Subset Seed Automaton -- A Measure for the Degree of Nondeterminism of Context-Free Languages -- Efficient Computation of Throughput Values of Context-Free Languages -- Analyzing Ambiguity of Context-Free Grammars -- Efficient Enumeration of Regular Languages -- Multi-grain Relations -- Memory Reduction for Strategies in Infinite Games -- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Finite State Automata Representing Two-Dimensional Subshifts -- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages -- Poster Abstracts -- REGAL: A Library to Randomly and Exhaustively Generate Automata -- A Finite-State Super-Chunker -- The Constrained Longest Common Subsequence Problem for Degenerate Strings -- Finite Automata Accepting Star-Connected Languages -- Efficiently Matching withLocal Grammars Using Prefix Overlay Transducers -- Significant Subpatterns Matching -- A New Method for Compiling Parallel Replacement Rules.
520 _aThe 12th International Conference on Implementation and Application of - tomata CIAA 2007 washeld at the Czech Technical Universityin Prague,Czech Republic on July 16-18, 2007. These proceedings contain the papers that were presented at CIAA 2007, as well as the abstracts of the poster papers that were displayed during the conference. The proceedings also include the abstracts and extended abstracts offourinvitedlecturespresentedbyGheorghePau ? n,MichaelRiley,MosheVardi, and Bruce W. Watson. The 23 regular papers and 7 poster papers were selected from 79 submitted papers covering various topics in the theory, implementation, and application of automataandrelatedstructures.Eachsubmitted paper wasreviewedbyatleast threeProgramCommitteemembers,with the assistanceofreferees.Theauthors of the papers presented here come from the following countries: Canada, Czech Republic, Denmark, Finland, France, Germany, Greece, Israel, Italy, Poland, Romania, Russia, South Africa, Spain, Sweden, UK, and USA. We wish to thank all those who made this meeting possible: the authors for submitting papers, the Program Committee members and external referees (listed on pages VII and VIII) for their excellent work, and last but not least our four invited speakers. Finally, we wish to express our sincere appreciation to the sponsors and local organizers.
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aMachine theory.
_9126598
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aTheory of Computation.
_9126599
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9126600
700 1 _aHolub, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126601
700 1 _aŽdárek, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126602
710 2 _aSpringerLink (Online service)
_9126603
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540763352
776 0 8 _iPrinted edition:
_z9783540845560
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4783
_9126604
856 4 0 _uhttps://doi.org/10.1007/978-3-540-76336-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91137
_d91137