000 | 03816nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-37214-1 | ||
003 | DE-He213 | ||
005 | 20160624101937.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540372141 _9978-3-540-37214-1 |
||
024 | 7 |
_a10.1007/11812128 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aImplementation and Application of Automata _h[electronic resource] : _b11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006. Proceedings / _cedited by Oscar H. Ibarra, Hsu-Chun Yen. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006. |
|
300 |
_aXIII, 291 p. Also available online. _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, _x0302-9743 ; _v4094 |
|
505 | 0 | _aInvited Lectures -- Information Distance and Its Applications -- Theory Inspired by Gene Assembly in Ciliates -- On the State Complexity of Combined Operations -- Technical Contributions -- Path-Equivalent Removals of ?-transitions in a Genomic Weighted Finite Automaton -- Hybrid Extended Finite Automata -- Refinement of Near Random Access Video Coding with Weighted Finite Automata -- Borders and Finite Automata -- Finding Common Motifs with Gaps Using Finite Automata -- Factor Oracles -- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice -- Tiburon: A Weighted Tree Automata Toolkit -- Around Hopcroft’s Algorithm -- Multi-tape Automata with Symbol Classes -- On the Computation of Some Standard Distances Between Probabilistic Automata -- Does o-Substitution Preserve Recognizability? -- Correctness Preservation and Complexity of Simple RL-Automata -- Bisimulation Minimization of Tree Automata -- Forgetting Automata and Unary Languages -- Structurally Unambiguous Finite Automata -- Symbolic Implementation of Alternating Automata -- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis -- Finite-State Temporal Projection -- Compiling Linguistic Constraints into Finite State Automata -- Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time -- A Family of Algorithms for Non Deterministic Regular Languages Inference -- Poster Abstracts -- XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof -- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems -- Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits -- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic -- Lexical Disambiguation with Polarities and Automata -- Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression -- Tighter Packed Bit-Parallel NFA for Approximate String Matching. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_aIbarra, Oscar H. _eeditor. |
|
700 | 1 |
_aYen, Hsu-Chun. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540372134 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4094 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/11812128 |
942 |
_2EBK4370 _cEBK |
||
999 |
_c33664 _d33664 |