عنوان
پدید آورنده
موضوع
رده
QA267 .L38 2019eb
QA267
.
L38
2019eb
کتابخانه
محل استقرار
INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
3030134342
(Number (ISBN
3030134350
(Number (ISBN
9783030134341
(Number (ISBN
9783030134358
Erroneous ISBN
9783030134341
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
Language and Automata Theory and Applications :
General Material Designation
[Book]
Other Title Information
13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings /
First Statement of Responsibility
Carlos Martín-Vide, Alexander Okhotin, Dana Shapira (eds.).
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Cham, Switzerland :
Name of Publisher, Distributor, etc.
Springer,
Date of Publication, Distribution, etc.
2019.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (xvii, 470 pages) :
Other Physical Details
illustrations (some color)
SERIES
Series Title
Lecture notes in computer science ;
Series Title
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Volume Designation
11417
GENERAL NOTES
Text of Note
International conference proceedings.
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references and author index.
CONTENTS NOTE
Text of Note
Intro; Preface; Organization; Abstracts of Invited Papers; Searching and Indexing Compressed Text; Pattern Discovery in Biological Sequences; Contents; Invited Papers; Modern Aspects of Complexity Within Formal Languages; 1 Introduction; 2 Some Modern Concepts of Complexity Theory; 3 First Case Study: String-to-String Correction S2S; 4 Second Case Study: Grammar-Based Compression; 5 Third Case Study: Synchronizing Words; 6 Fourth Case Study: Consistency Problem for DFAs; 7 Fifth Case Study: Lower Bounds for Universality; 8 Sixth Case Study: Parsing Theory; 9 Conclusions; References
Text of Note
4 Main TheoremReferences; Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata; 1 Introduction; 2 Higher-Order CA and Linear CA; 3 Dynamical Properties; 4 Sensitivity of Frobenius LCA over Znpk; 5 Conclusions; References; On Varieties of Ordered Automata; 1 Introduction; 2 Ordered Automata; 3 Positive C-Varieties of Ordered Semiautomata; 4 Examples; 4.1 Counter-Free Automata; 4.2 Acyclic Automata; 4.3 Acyclic Confluent Automata; 4.4 Ordered Automata with Extensive Actions; 4.5 Autonomous Automata; 4.6 Synchronizing and Weakly Confluent Automata
Text of Note
4 The One-Way Polynomial-Size Oracle Hierarchy5 A Characterization for the Alternating Hierarchy; 6 Conclusion; References; Orbits of Abelian Automaton Groups; 1 Introduction; 2 Background; 2.1 Automata and Automaton Groups; 2.2 Abelian Automata; 3 Affine Residuation Parametrization; 3.1 Residuation Pairs; 3.2 Number Field Embedding; 4 Orbit Rationality; 4.1 Background; 4.2 The Abelian Case; 4.3 Decision Procedure; 5 Discussion and Open Problems; References; Bounded Automata Groups are co-ET0L; 1 Introduction; 2 ET0L Languages and CSPD Automata; 2.1 CSPD Automata; 3 Bounded Automata Groups
Text of Note
4.7 Automata for Languages Closed Under Inserting Segments4.8 Automata for Finite and Prefix-Testable Languages; 5 Membership Problem for C-Varieties of Semiautomata; References; Automata over Infinite Sequences of Reals; 1 Introduction; 2 The Automaton Model; 3 Periodic Muller R-automata; 4 A Logic for Periodic R-automata; 4.1 From Periodic R-automata to Formulas; 4.2 From MSOR Logic to Periodic Automata; References; Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice; 1 Prelude: Quick Overview
Text of Note
Observation and Interaction1 Interaction vs. Observation; References; From Words to Graphs, and Back; 1 Introduction; 2 Words, Graphs and Well-quasi-ordering; 2.1 An Introductory Example; 2.2 Geometric Grid Classes of Permutations and Letter Graphs; 2.3 Deciding WQO; 3 Representing Graphs by Words; 3.1 Entropy of Hereditary Properties; 3.2 Coding of Graphs in Classes of High Speed; 3.3 Representing Graphs in Hereditary Classes of Low Speed; References; Automata; An Oracle Hierarchy for Small One-Way Finite Automata; 1 Introduction; 2 Preparation; 3 Oracle-1NFAs
0
8
8
8
8
SUMMARY OR ABSTRACT
Text of Note
This book constitutes the refereed proceedings of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019, held in St. Petersburg, Russia, in March 2019. The 31 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 98 submissions. The papers cover the following topics: Automata; Complexity; Grammars; Languages; Graphs, trees and rewriting; and Words and codes.
ACQUISITION INFORMATION NOTE
Source for Acquisition/Subscription Address
Springer Nature
Stock Number
com.springer.onix.9783030134358
PARALLEL TITLE PROPER
Parallel Title
LATA 2019
TOPICAL NAME USED AS SUBJECT
Formal languages, Congresses.
Machine theory, Congresses.
Mathematical linguistics, Congresses.
Formal languages.
Machine theory.
Mathematical linguistics.
DEWEY DECIMAL CLASSIFICATION
Number
005
.
101/5113
Edition
23
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QA267
Book number
.
L38
2019eb
PERSONAL NAME - ALTERNATIVE RESPONSIBILITY
Martín Vide, Carlos
Okhotin, Alexander
Shapira, Dana
CORPORATE BODY NAME - PRIMARY RESPONSIBILITY
LATA (Conference)(13th :2019 :, Saint Petersburg, Russia)
ORIGINATING SOURCE
Date of Transaction
20200823083244.0
Cataloguing Rules (Descriptive Conventions))
pn
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب [Book]
Y
