|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-35430-7 |
| 003 |
DE-He213 |
| 005 |
20230810201806.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540354307
|9 978-3-540-35430-7
|
| 024 |
7 |
|
|a 10.1007/11779148
|2 doi
|
| 050 |
|
4 |
|a QA267-268.5
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a MAT018000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 005.131
|2 23
|
| 245 |
1 |
0 |
|a Developments in Language Theory
|h [electronic resource] :
|b 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings /
|c edited by Oscar H. Ibarra, Zhe Dang.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XII, 456 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4036
|
| 505 |
0 |
|
|a Invited Lectures -- Adding Nesting Structure to Words -- Can Abstract State Machines Be Useful in Language Theory? -- Languages in Membrane Computing: Some Details for Spiking Neural P Systems -- Computational Nature of Biochemical Reactions -- Papers -- Polynomials, Fragments of Temporal Logic and the Variety DA over Traces -- Weighted Automata and Weighted Logics on Infinite Words -- Simulation Relations for Alternating Parity Automata and Parity Games -- Equivalence of Functions Represented by Simple Context-Free Grammars with Output -- On the Gap-Complexity of Simple RL-Automata -- Noncanonical LALR(1) Parsing -- Context-Free Grammars and XML Languages -- Synchronization of Pushdown Automata -- Context-Dependent Nondeterminism for Pushdown Automata -- Prime Decompositions of Regular Languages -- On Weakly Ambiguous Finite Transducers -- Ciliate Bio-operations on Finite String Multisets -- Characterizing DNA Bond Shapes Using Trajectories -- Involution Solid and Join Codes -- Well-Founded Semantics for Boolean Grammars -- Hierarchies of Tree Series Transformations Revisited -- Bag Context Tree Grammars -- Closure of Language Classes Under Bounded Duplication -- The Boolean Closure of Growing Context-Sensitive Languages -- Well Quasi Orders and the Shuffle Closure of Finite Sets -- The Growth Ratio of Synchronous Rational Relations Is Unique -- On Critical Exponents in Fixed Points of Non-erasing Morphisms -- P Systems with Proteins on Membranes and Membrane Division -- Computing by Only Observing -- A Decision Procedure for Reflexive Regular Splicing Languages -- Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages -- End-Marked Maximal Depth-First Contextual Grammars -- Some Examples of Semi-rational DAG Languages -- Finding Lower Bounds for Nondeterministic State Complexity Is Hard -- Lowering Undecidability Bounds for Decision Questions in Matrices -- Complexity of Degenerated Three Dimensional Billiard Words -- Factorial Languages of Low Combinatorial Complexity -- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy -- Language Equations with Complementation -- Synchronizing Automata with a Letter of Deficiency 2 -- On Some Variations of Two-Way Probabilistic Finite Automata Models.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
1 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 700 |
1 |
|
|a Ibarra, Oscar H.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Dang, Zhe.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540825708
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540354284
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4036
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11779148
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
