Звичайний вигляд Перегляд у МАРК Перегляд у ISBD

Descriptional Complexity of Formal Systems (Запис № 447930)

МАРК-запис
000 -LEADER
fixed length control field	05448nam a22006735i 4500
001 - CONTROL NUMBER
control field	978-3-319-60252-3
003 - CONTROL NUMBER IDENTIFIER
control field	DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field	20210118131750.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field	cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	170602s2017 gw \| s \|\|\|\| 0\|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	9783319602523
--	978-3-319-60252-3
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code	10.1007/978-3-319-60252-3
Source of number or code	doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number	QA76.9.L63
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number	QA76.5913
072 #7 - SUBJECT CATEGORY CODE
Subject category code	UM
Source	bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code	COM051000
Source	bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code	UM
Source	thema
072 #7 - SUBJECT CATEGORY CODE
Subject category code	UYF
Source	thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number	005.1015113
Edition number	23
245 10 - TITLE STATEMENT
Title	Descriptional Complexity of Formal Systems
Medium	[electronic resource] :
Remainder of title	19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings /
Statement of responsibility, etc	edited by Giovanni Pighizzini, Cezar Câmpeanu.
250 ## - EDITION STATEMENT
Edition statement	1st ed. 2017.
264 #1 -
--	Cham :
--	Springer International Publishing :
--	Imprint: Springer,
--	2017.
300 ## - PHYSICAL DESCRIPTION
Extent	X, 311 p. 76 illus.
Other physical details	online resource.
336 ## -
--	text
--	txt
--	rdacontent
337 ## -
--	computer
--	c
--	rdamedia
338 ## -
--	online resource
--	cr
--	rdacarrier
347 ## -
--	text file
--	PDF
--	rda
490 1# - SERIES STATEMENT
Series statement	Theoretical Computer Science and General Issues ;
Том/ позначення послідовності	10316
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note	Sensing as a Complexity Measure -- Avoiding Overlaps in Pictures -- Descriptional Complexity and Operations - Two non-Classical Cases -- Applications of Transducers in Independent Languages, Word Distances, Codes -- On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages -- On the Average Complexity of Strong Star Normal Form -- Most Complex Non-Returning Regular Languages -- Uncountable realtime probabilistic classes -- A Parametrized Analysis of Algorithms on Hierarchical Graphs -- Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity -- Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors -- Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete -- Self-attraction removal from oritatami systems -- One-Time Nondeterministic Computations -- Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages -- Branching Measures and Nearly Acyclic NFAs -- Square on Deterministic, Alternating, and Boolean Finite Automata -- A Pumping Lemma for Ordered Restarting Automata -- Concise Representations of Reversible Automata -- State Complexity of Unary SV-XNFA with Different Acceptance Conditions -- Reset Complexity of Ideal Languages Over a Binary Alphabet -- 2-state 2-symbol Turing machines with periodic support produce regular sets -- State Complexity of Suffix Distance -- The quotient operation on input-driven pushdown automata.
520 ## - SUMMARY, ETC.
Summary, etc	This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully reviewed and selected from 26 submissions.Descriptional Complexity is a ﬁeld in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, ﬁnite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.
506 ## - RESTRICTIONS ON ACCESS NOTE
Terms governing access	Available to subscribing member institutions only. Доступно лише організаціям членам підписки.
506 ## - RESTRICTIONS ON ACCESS NOTE
Standardized terminology for access restriction	Online access from local network of NaUOA.
506 ## - RESTRICTIONS ON ACCESS NOTE
Standardized terminology for access restriction	Online access with authorization at https://link.springer.com/
506 ## - RESTRICTIONS ON ACCESS NOTE
Standardized terminology for access restriction	Онлайн-доступ з локальної мережі НаУОА.
506 ## - RESTRICTIONS ON ACCESS NOTE
Standardized terminology for access restriction	Онлайн доступ з авторизацією на https://link.springer.com/
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Computer logic.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Computers.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Mathematical logic.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Software engineering.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Logics and Meanings of Programs.
--	http://scigraph.springernature.com/things/product-market-codes/I1603X
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Computation by Abstract Devices.
--	http://scigraph.springernature.com/things/product-market-codes/I16013
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Mathematical Logic and Formal Languages.
--	http://scigraph.springernature.com/things/product-market-codes/I16048
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Algorithm Analysis and Problem Complexity.
--	http://scigraph.springernature.com/things/product-market-codes/I16021
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Software Engineering/Programming and Operating Systems.
--	http://scigraph.springernature.com/things/product-market-codes/I14002
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Pighizzini, Giovanni.
Relator term	editor.
--	(orcid)0000-0002-7509-7842
--	https://orcid.org/0000-0002-7509-7842
Relator code	edt
--	http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Câmpeanu, Cezar.
Relator term	editor.
--	(orcid)0000-0002-9777-3012
--	https://orcid.org/0000-0002-9777-3012
Relator code	edt
--	http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element	SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title	Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text	Printed edition:
International Standard Book Number	9783319602516
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text	Printed edition:
International Standard Book Number	9783319602530
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title	Theoretical Computer Science and General Issues ;
Volume number/sequential designation	10316
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier	<a href="https://doi.org/10.1007/978-3-319-60252-3">https://doi.org/10.1007/978-3-319-60252-3</a>
912 ## -
--	ZDB-2-SCS
912 ## -
--	ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	ЕКнига

Немає доступних примірників.