國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Descriptional complexity of formal s...

(1998 :)

Descriptional complexity of formal systems19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Descriptional complexity of formal systemsedited by Giovanni Pighizzini, Cezar Campeanu.
其他題名:	19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017 : proceedings /
其他題名:	DCFS 2017
其他作者:	Pighizzini, Giovanni.
團體作者:
出版者:	Cham :Springer International Publishing :2017.
面頁冊數:	x, 311 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Formal methods (Computer science)
電子資源:	http://dx.doi.org/10.1007/978-3-319-60252-3
ISBN:	9783319602523$q(electronic bk.)

Descriptional complexity of formal systems19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017 : proceedings /
Descriptional complexity of formal systems19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017 : proceedings /[electronic resource] :DCFS 2017edited by Giovanni Pighizzini, Cezar Campeanu. - Cham :Springer International Publishing :2017. - x, 311 p. :ill., digital ;24 cm. - Lecture notes in computer science,103160302-9743 ;. - Lecture notes in computer science ;4891..

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.

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.

ISBN: 9783319602523$q(electronic bk.)

Standard No.: 10.1007/978-3-319-60252-3doiSubjects--Topical Terms:

277520
Formal methods (Computer science)

LC Class. No.: QA76.9.F67 / D34 2017

Dewey Class. No.: 004.0151

Descriptional complexity of formal systems19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017 : proceedings /
LDR:03341nmm a2200361 a 4500 001 517652
003 DE-He213
005 20170602193941.0
006 m d
007 cr nn 008maaau
008 180316s2017 gw s 0 eng d
020 $a 9783319602523$q(electronic bk.)
020 $a 9783319602516$q(paper)
024 7 $a 10.1007/978-3-319-60252-3 $2 doi
035 $a 978-3-319-60252-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.F67 $b D34 2017
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.F67 $b D277 2017
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Descriptional complexity of formal systems $h [electronic resource] : $b 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017 : proceedings / $c edited by Giovanni Pighizzini, Cezar Campeanu.
246 3 $a DCFS 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a x, 311 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10316
505 0 $a 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 $a 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.
650 0 $a Formal methods (Computer science) $3 277520
650 0 $a Formal languages $v Congresses. $3 443051
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Computation by Abstract Devices. $3 273703
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
700 1 $a Pighizzini, Giovanni. $3 522431
700 1 $a Campeanu, Cezar. $3 787335
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-60252-3
950 $a Computer Science (Springer-11645)