top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Language and automata theory and applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe (eds.).
Language and automata theory and applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe (eds.).
Creatore [LATA (Conference) (9th : 2015 : Nice, France)]
Estensione 1 online resource (xv, 754 pages) : illustrations.
Disciplina 004
Accesso persona Horia Dediu, Adrian, editor
Formenti, Enrico, 1968-editor
Martín Vide, Carlos, editor
Truthe, Bianca, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319155791
3319155792
3319155784
9783319155784
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms -- Automata, Logic, and Concurrency -- Codes, Semigroups, and Symbolic Dynamics -- Combinatorics on Words -- Complexity and Recursive Functions -- Compression, Inference, Pattern Matching, and Model Checking -- Graphs, Term Rewriting, and Networks -- Transducers, Tree Automata, and Weighted Automata.
Record Nr. NYU-006560626
[LATA (Conference) (9th : 2015 : Nice, France)]  
Materiale a stampa
Lo trovi qui: New York University
Language and automata theory and applications [electronic resource] : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe (eds.).
Language and automata theory and applications [electronic resource] : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe (eds.).
Creatore [LATA (Conference) (7th : 2013 : Bilbao, Spain)]
Estensione 1 online resource.
Disciplina 004
Accesso persona Horia Dediu, Adrian
Martín Vide, Carlos
Truthe, Bianca
Genere/Forma Electronic books
Soggetto non controllato Computer science
Computer software
Logic design
Artificial intelligence
Social sciences -- Data processing
Computation by Abstract Devices
Mathematical Logic and Formal Languages
Logics and Meanings of Programs
ISBN 9783642370649 (electronic bk.)
3642370640 (electronic bk.)
9783642370632
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks. Complexity Dichotomy for Counting Problems / Jin-Yi Cai -- Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems / Kousha Etessami -- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking / Luke Ong -- Discrete Linear Dynamical Systems / Joël Ouaknine -- XML Schema Management: A Challenge for Automata Theory / Thomas Schwentick -- Regular Papers. On the Complexity of Shortest Path Problems on Discounted Cost Graphs / Rajeev Alur ... [et al.] -- Termination of Rule-Based Calculi for Uniform Semi-Unification / Takahito Aoto, Munehiro Iwami -- Deciding WQO for Factorial Languages / Aistis Atminas, Vadim Lozin, Mikhail Moshkov -- On the Construction of a Family of Automata That Are Generically Non-minimal / Parisa Babaali, Christopher Knaplund -- Limited Non-determinism Hierarchy of Counter Automata / Sebastian Bala, Dariusz Jackowski -- Unambiguous Automata Denoting Finitely Sequential Functions / Sebastian Bala, Artur Koniński --
Duplication-Loss Genome Alignment: Complexity and Algorithm / Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk -- Maximizing Entropy over Markov Processes / Fabrizio Biondi ... [et al.] -- MAT Learning of Universal Automata / Johanna Björklund, Henning Fernau, Anna Kasprzik -- A Graph Polynomial Approach to Primitivity / Francine Blanchet-Sadri ... [et al.] -- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem / Francine Blanchet-Sadri, Justin Lazarow -- Dynamic Communicating Automata and Branching High-Level MSCs / Benedikt Bollig ... [et al.] -- Visibly Pushdown Automata: Universality and Inclusion via Antichains / Véronique Bruyère, Marc Ducobu, Olivier Gauwin -- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions / Jean-Marc Champarnaud ... [et al.] -- How to Travel between Languages / Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin -- Execution Information Rate for Some Classes of Automata / Cewei Cui ... [et al.] --
Record Nr. UPENN-9960105273503681
[LATA (Conference) (7th : 2013 : Bilbao, Spain)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Language and automata theory and applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe (eds.).
Language and automata theory and applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe (eds.).
Creatore [LATA (Conference) (9th : 2015 : Nice, France)]
Estensione 1 online resource (xv, 754 pages) : illustrations.
Disciplina 004
Accesso persona Horia Dediu, Adrian, editor
Formenti, Enrico, 1968-editor
Martín Vide, Carlos, editor
Truthe, Bianca, editor
ISBN 9783319155791
3319155792
3319155784 (print)
9783319155784 (print)
9783319155784
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms -- Automata, Logic, and Concurrency -- Codes, Semigroups, and Symbolic Dynamics -- Combinatorics on Words -- Complexity and Recursive Functions -- Compression, Inference, Pattern Matching, and Model Checking -- Graphs, Term Rewriting, and Networks -- Transducers, Tree Automata, and Weighted Automata.
Record Nr. UALBERTA-6930275
[LATA (Conference) (9th : 2015 : Nice, France)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Language and automata theory and applications : third international conference, LATA 2009, Tarragona, Spain, April 2-8, 2009 : proceedings / Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide (eds.).
Language and automata theory and applications : third international conference, LATA 2009, Tarragona, Spain, April 2-8, 2009 : proceedings / Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide (eds.).
Creatore [LATA (Conference) (3rd : 2009 : Tarragona, Spain)]
Estensione 1 online resource (xv, 754 pages) : illustrations.
Disciplina 005.13/1
Accesso persona Horia Dediu, Adrian
Mihai Ionescu, Armand
Martín Vide, Carlos
ISBN 9783642009822
3642009824
9783642009815
3642009816
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Recent Developments in Algorithmic Teaching -- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications -- Descriptional and Computational Complexity of Finite Automata -- Hypothesis Spaces for Learning -- State Complexity of Nested Word Automata -- Regular Papers -- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations -- Minimal Union-Free Decompositions of Regular Languages -- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory -- Matching Trace Patterns with Regular Policies -- Absolute Convergence of Rational Series Is Semi-decidable -- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] -- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights -- Refinement and Consistency of Timed Modal Specifications -- Nondeterministic Instance Complexity and Proof Systems with Advice -- How Many Holes Can an Unbordered Partial Word Contain? -- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms -- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization -- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication -- Picture Languages Generated by Assembling Tiles -- Undecidability of Operation Problems for T0L Languages and Subclasses -- Decision Problems for Convex Languages -- On a Family of Morphic Images of Arnoux-Rauzy Words -- Monadic Datalog Tree Transducers -- On Extended Regular Expressions -- Multi-tilde Operators and Their Glushkov Automata -- Non-uniform Cellular Automata -- A Cryptosystem Based on the Composition of Reversible Cellular Automata -- Grammars Controlled by Special Petri Nets -- Nested Counters in Bit-Parallel String Matching -- Bounded Delay and Concurrency for Earliest Query Answering -- Learning by Erasing in Dynamic Epistemic Logic -- The Fault Tolerance of NP-Hard Problems -- Termination of Priority Rewriting -- State Complexity of Combined Operations for Prefix-Free Regular Languages -- Towards a Taxonomy for ECFG and RRPG Parsing -- Counting Parameterized Border Arrays for a Binary Alphabet -- Bounded Hairpin Completion -- Rigid Tree Automata -- Converting Self-verifying Automata into Deterministic Automata -- Two Equivalent Regularizations for Tree Adjoining Grammars -- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching -- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata -- Automata on Gauss Words -- Analysing Complexity in Classes of Unary Automatic Structures -- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words -- Segmentation Charts for Czech -- Relations among Segments in Complex Sentences -- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions -- Efficiency of the Symmetry Bias in Grammar Acquisition -- A Series of Run-Rich Strings -- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes -- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates -- Prediction of Creole Emergence in Spatial Language Dynamics -- On the Average Size of Glushkov's Automata -- Tiling the Plane with a Fixed Number of Polyominoes -- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality -- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata -- Finitely Generated Synchronizing Automata -- Genetic Algorithm for Synchronization -- Constructing Infinite Words of Intermediate Arithmetical Complexity -- From Gene Trees to Species Trees through a Supertree Approach -- A Kleene Theorem for Forest Languages -- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions -- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit.
Record Nr. STANFORD-a9108879
[LATA (Conference) (3rd : 2009 : Tarragona, Spain)]  
Materiale a stampa
Lo trovi qui: Stanford University
Language and automata theory and applications : second international conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. revised papers / Carlos Martin-Vide, Friedrich Otto, Henning Fernau (eds.).
Language and automata theory and applications : second international conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. revised papers / Carlos Martin-Vide, Friedrich Otto, Henning Fernau (eds.).
Creatore [LATA 2008 (2008 : Tarragona, Spain)]
Estensione 1 online resource (xiv, 500 p.) : ill.
Disciplina 006.3/1
Accesso persona Martín Vide, Carlos
Otto, Friedrich
Fernau, Henning, 1965-
Genere/Forma Electronic books
ISBN 9783540882817
3540882812
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-004460269
[LATA 2008 (2008 : Tarragona, Spain)]  
Materiale a stampa
Lo trovi qui: Duke University
Language and automata theory and applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe (eds.).
Language and automata theory and applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe (eds.).
Creatore [LATA (Conference) (9th : 2015 : Nice, France)]
Estensione 1 online resource (xv, 754 pages) : illustrations.
Disciplina 004
Accesso persona Horia Dediu, Adrian, editor
Formenti, Enrico, 1968- editor
Martín Vide, Carlos, editor
Truthe, Bianca, editor
ISBN 9783319155791
3319155792
3319155784
9783319155784
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms -- Automata, Logic, and Concurrency -- Codes, Semigroups, and Symbolic Dynamics -- Combinatorics on Words -- Complexity and Recursive Functions -- Compression, Inference, Pattern Matching, and Model Checking -- Graphs, Term Rewriting, and Networks -- Transducers, Tree Automata, and Weighted Automata.
Record Nr. STANFORD-a10806206
[LATA (Conference) (9th : 2015 : Nice, France)]  
Materiale a stampa
Lo trovi qui: Stanford University
Language and automata theory and applications [electronic resource] : 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, proceedings / Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron (eds.).
Language and automata theory and applications [electronic resource] : 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, proceedings / Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron (eds.).
Creatore [LATA (Conference) (14th : 2020 : Milan, Italy)]
Estensione 1 online resource (xi, 449 p.) : 409 illustrations (some color)
Disciplina 005.1015113
Accesso persona Leporati, Alberto
Martín Vide, Carlos
Shapira, Dana
Zandron, Claudio
ISBN 9783030406080
3030406083
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited papers -- The New Complexity Landscape around Circuit Minimization -- Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases -- Approaching Arithmetic Theories with Finite-State Automata -- Recompression: technique for word equations and compressed data -- How to prove that a language is regular or star-free -- Deciding classes of regular languages: the covering approach -- Algebraic Structures -- Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles Over the Circle -- Deciding (R, +, < , 1) in (R, +, < , Z) -- Ordered Semiautomatic Rings with Applications to Geometry -- Automata -- Boolean monadic recursive schemes as a logical characterization of the subsequential functions -- Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models -- Windable Heads & Recognizing NL with Constant Randomness -- Alternating Finite Automata with Limited Universal Branching -- Pebble-Intervals Automata and FO2 with Two Orders -- Limited Two-Way Deterministic Finite Automata with Advice -- Complexity -- On the size of depth-two threshold circuits for the inner product mod 2 function -- Complexity Issues of String to Graph Approximate Matching -- Complexity of Automatic Sequences -- Grammars -- Context-sensitive Fusion Grammars are Universal -- Cyclic shift on multi-component grammars -- Languages -- The Automatic Baire Property and an Effective Property of omega-Rational Functions -- The Power of Programs over Monoids in J -- Geometrically Closed Positive Varieties of Star-Free Languages -- Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas -- Trees and Graphs -- On the Weisfeiler-Leman Dimension of Fractional Packing -- Input Strictly Local Tree Transducers -- Words and Codes -- Lyndon words versus inverse Lyndon words: queries on su xes and bordered words -- On collapsing pre x normal words -- Simplified Parsing Expression Derivatives -- Complet e Variable-Length Codes: An Excursion into Word Edit Operations
Record Nr. STANFORD-a13574778
[LATA (Conference) (14th : 2020 : Milan, Italy)]  
Materiale a stampa
Lo trovi qui: Stanford University
Language and automata theory and applications : third international conference, LATA 2009, Tarragona, Spain, April 2-8, 2009 : proceedings / Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide (eds.).
Language and automata theory and applications : third international conference, LATA 2009, Tarragona, Spain, April 2-8, 2009 : proceedings / Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide (eds.).
Creatore [LATA (Conference) (3rd : 2009 : Tarragona, Spain)]
Estensione 1 online resource (xv, 754 pages) : illustrations.
Disciplina 005.13/1
Accesso persona Horia Dediu, Adrian
Mihai Ionescu, Armand
Martín Vide, Carlos
ISBN 9783642009822
3642009824
9783642009815
3642009816
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7955223
[LATA (Conference) (3rd : 2009 : Tarragona, Spain)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Language and automata theory and applications : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe (eds.).
Language and automata theory and applications : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe (eds.).
Creatore [LATA (Conference) (7th : 2013 : Bilbao, Spain)]
Estensione 1 online resource (xiv, 580 pages) : illustrations.
Disciplina 004
Accesso persona Horia Dediu, Adrian
Martín Vide, Carlos
Truthe, Bianca
Genere/Forma Electronic books
Conference papers and proceedings
Congresses
Soggetto non controllato Computer science
Computer software
Logic design
Artificial intelligence
Social sciences -- Data processing
Computation by Abstract Devices
Mathematical Logic and Formal Languages
Logics and Meanings of Programs
ISBN 9783642370649
3642370640
9783642370632
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks. Complexity Dichotomy for Counting Problems / Jin-Yi Cai -- Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems / Kousha Etessami -- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking / Luke Ong -- Discrete Linear Dynamical Systems / Joël Ouaknine -- XML Schema Management: A Challenge for Automata Theory / Thomas Schwentick -- Regular Papers. On the Complexity of Shortest Path Problems on Discounted Cost Graphs / Rajeev Alur [and others] -- Termination of Rule-Based Calculi for Uniform Semi-Unification / Takahito Aoto, Munehiro Iwami -- Deciding WQO for Factorial Languages / Aistis Atminas, Vadim Lozin, Mikhail Moshkov -- On the Construction of a Family of Automata That Are Generically Non-minimal / Parisa Babaali, Christopher Knaplund -- Limited Non-determinism Hierarchy of Counter Automata / Sebastian Bala, Dariusz Jackowski -- Unambiguous Automata Denoting Finitely Sequential Functions / Sebastian Bala, Artur Koniński.
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks / Giorgio Delzanno, Riccardo Traverso -- The Buffered π-Calculus: A Model for Concurrent Languages / Xiaojie Deng [and others] -- Mix-Automatic Sequences / Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks -- A Multivariate Analysis of Some DFA Problems / Henning Fernau, Pinar Heggernes, Yngve Villanger -- On the Size Complexity of Deterministic Frequency Automata / Rūsiņš Freivalds, Thomas Zeugmann, Grant R. Pogosyan -- On the Number of Unbordered Factors / Daniel Goč, Hamoon Mousavi, Jeffrey Shallit -- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences / Daniel Goč, Kalle Saari, Jeffrey Shallit -- Efficient Submatch Extraction for Practical Regular Expressions / Stuart Haber [and others] -- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers / Kenji Hashimoto [and others].
Duplication-Loss Genome Alignment: Complexity and Algorithm / Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk -- Maximizing Entropy over Markov Processes / Fabrizio Biondi [and others] -- MAT Learning of Universal Automata / Johanna Björklund, Henning Fernau, Anna Kasprzik -- A Graph Polynomial Approach to Primitivity / Francine Blanchet-Sadri [and others] -- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem / Francine Blanchet-Sadri, Justin Lazarow -- Dynamic Communicating Automata and Branching High-Level MSCs / Benedikt Bollig [and others] -- Visibly Pushdown Automata: Universality and Inclusion via Antichains / Véronique Bruyère, Marc Ducobu, Olivier Gauwin -- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions / Jean-Marc Champarnaud [and others] -- How to Travel between Languages / Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin -- Execution Information Rate for Some Classes of Automata / Cewei Cui [and others].
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion / Milka Hutagalung, Martin Lange, Etienne Lozes -- On Bounded Languages and Reversal-Bounded Automata / Oscar H. Ibarra, Bala Ravikumar -- Rewrite Closure and CF Hedge Automata / Florent Jacquemard, Michael Rusinowitch -- Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing / Tomasz Kociumaka [and others]́ -- From Regular Tree Expression to Position Tree Automaton / Éric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi -- Convergence of Newton's Method over Commutative Semirings / Michael Luttenberger, Maximilian Schlund -- Counting Minimal Symmetric Difference NFAs / Brink van der Merwe, Mark Farag, Jaco Geldenhuys -- Interval Logics and ωB-Regular Languages / Angelo Montanari, Pietro Sala -- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars / Katsuhiko Nakamura, Keita Imada.
Asynchronous PC Systems of Pushdown Automata / Friedrich Otto -- Model Checking Metric Temporal Logic over Automata with One Counter / Karin Quaas -- Coinductive Proof Techniques for Language Equivalence / Jurriaan Rot, Marcello Bonsangue, Jan Rutten -- Ostrowski Numeration and the Local Period of Sturmian Words / Luke Schaeffer -- Boolean Algebras of Regular ω-Languages / Victor Selivanov, Anton Konovalov -- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars / Eli Shamir -- Online Matching of Multiple Regular Patterns with Gaps and Character Classes / Seppo Sippu, Eljas Soisalon-Soininen -- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems / Tim Smith -- Uniformisation of Two-Way Transducers / Rodrigo de Souza -- A Conditional Superpolynomial Lower Bound for Extended Resolution / Olga Tveretina -- A Turing Machine Distance Hierarchy / Stanislav Žák, Jiří Šíma.
Record Nr. NYU-004628180
[LATA (Conference) (7th : 2013 : Bilbao, Spain)]  
Materiale a stampa
Lo trovi qui: New York University
Language and automata theory and applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings / Frank Drewes, Carlos Martín-Vide, Bianca Truthe (eds.).
Language and automata theory and applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings / Frank Drewes, Carlos Martín-Vide, Bianca Truthe (eds.).
Creatore [LATA (Conference) (11th : 2017 : Umeå, Sweden)]
Estensione 1 online resource (xxiii, 462 pages) : illustrations.
Disciplina 006.3
Accesso persona Drewes, Frank, editor
Martín Vide, Carlos, editor
Truthe, Bianca, editor
ISBN 9783319537337
3319537334
9783319537320
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7791833
[LATA (Conference) (11th : 2017 : Umeå, Sweden)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium