000 | 04706nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-33097-4 | ||
003 | DE-He213 | ||
005 | 20240730185257.0 | ||
007 | cr nn 008mamaa | ||
008 | 100715s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540330974 _9978-3-540-33097-4 |
||
024 | 7 |
_a10.1007/11605157 _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] : _b10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers / _cedited by Jacques Farré, Igor Litovsky, Sylvain Schmitz. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aXIII, 360 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 ; _v3845 |
|
505 | 0 | _aInvited Lectures -- Languages Recognizable by Quantum Finite Automata -- The Language, the Expression, and the (Small) Automaton -- Technical Contributions -- Minimization of Non-deterministic Automata with Large Alphabets -- Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata -- Component Composition Preserving Behavioural Contracts Based on Communication Traces -- Strong Retiming Equivalence of Synchronous Schemes -- Prime Normal Form and Equivalence of Simple Grammars -- An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata -- Finite Automata and Unions of Regular Patterns with Bounded Constant Segments -- Inside Vaucanson -- Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton -- Shorter Regular Expressions from Finite-State Automata -- Wind in the Willows - Generating Music by Means of Tree Transducers -- On Deterministic Catalytic Systems -- Restricting the Use of Auxiliary Symbols for Restarting Automata -- A Class of Rational n-WFSM Auto-intersections -- Experiments with Deterministic ?-Automata for Formulas of Linear Temporal Logic -- Computing Affine Hulls over and from Sets Represented by Number Decision Diagrams -- Tree Automata and XPath on Compressed Trees -- Deeper Connections Between LTL and Alternating Automata -- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words -- Observations on Determinization of Büchi Automata -- The Interval Rank of Monotonic Automata -- Compressing XML Documents Using Recursive Finite State Automata -- Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment -- Size Reduction of Multitape Automata -- Robust Spelling Correction -- On Two-Dimensional Pattern Matching by Finite Automata -- Poster Abstracts -- Incremental andSemi-incremental Construction of Pseudo-Minimal Automata -- Is Learning RFSAs Better Than Learning DFAs? -- Learning Stochastic Finite Automata for Musical Style Recognition -- Simulation of Soliton Circuits -- Acyclic Automata with Easy-to-Find Short Regular Expressions -- On the Equivalence Problem for Programs with Mode Switching -- Automata and AB-Categorial Grammars -- On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set. | |
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aMachine theory. _9138660 |
|
650 | 1 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aTheory of Computation. _9138661 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9138662 |
700 | 1 |
_aFarré, Jacques. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9138663 |
|
700 | 1 |
_aLitovsky, Igor. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9138664 |
|
700 | 1 |
_aSchmitz, Sylvain. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9138665 |
|
710 | 2 |
_aSpringerLink (Online service) _9138666 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540310235 |
776 | 0 | 8 |
_iPrinted edition: _z9783540819257 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3845 _9138667 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11605157 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c92742 _d92742 |