東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Descriptional complexity of formal s...

DCFS (Workshop) (2019 :)

FindBook

Google Book

Amazon

博客來

Descriptional complexity of formal systems = 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Descriptional complexity of formal systems/ edited by Michal Hospodar, Galina Jiraskova, Stavros Konstantinidis.
其他題名:	21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019 : proceedings /
其他題名:	DCFS 2019
其他作者:	Hospodar, Michal.
團體作者:	DCFS (Workshop)
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	x, 299 p. :ill., digital ;24 cm.
內容註:	A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers -- On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory.
Contained By:	Springer Nature eBook
標題:	Formal methods (Computer science) - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-23247-4
ISBN:	9783030232474

Descriptional complexity of formal systems = 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019 : proceedings /
Descriptional complexity of formal systems21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019 : proceedings /[electronic resource] :DCFS 2019edited by Michal Hospodar, Galina Jiraskova, Stavros Konstantinidis. - Cham :Springer International Publishing :2019. - x, 299 p. :ill., digital ;24 cm. - Lecture notes in computer science,116120302-9743 ;. - Lecture notes in computer science ;11612..

A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers -- On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory.

ISBN: 9783030232474

Standard No.: 10.1007/978-3-030-23247-4doiSubjects--Topical Terms:

622707
Formal methods (Computer science)
--Congresses.

LC Class. No.: QA76.9.L63 / D34 2019

Dewey Class. No.: 005.1015113

Descriptional complexity of formal systems = 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019 : proceedings /
LDR:02668nmm a2200361 a 4500 001 2242813
003 DE-He213
005 20200701111641.0
006 m d
007 cr nn 008maaau
008 211207s2019 sz s 0 eng d
020 $a 9783030232474 $q (electronic bk.)
020 $a 9783030232467 $q (paper)
024 7 $a 10.1007/978-3-030-23247-4 $2 doi
035 $a 978-3-030-23247-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.L63 $b D34 2019
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
090 $a QA76.9.L63 $b D277 2019
111 2 $a DCFS (Workshop) $n (21st : $d 2019 : $c Kosice, Slovakia.) $3 3502363
245 1 0 $a Descriptional complexity of formal systems $h [electronic resource] : $b 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, 2019 : proceedings / $c edited by Michal Hospodar, Galina Jiraskova, Stavros Konstantinidis.
246 3 $a DCFS 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a x, 299 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11612
490 1 $a Theoretical computer science and general issues
505 0 $a A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers -- On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory.
650 0 $a Formal methods (Computer science) $v Congresses. $3 622707
650 0 $a Logic design. $3 527272
650 0 $a Computer science. $3 523869
650 0 $a Artificial intelligence. $3 516317
650 1 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Database Management. $3 891010
650 2 4 $a Special Purpose and Application-Based Systems. $3 892492
700 1 $a Hospodar, Michal. $3 3502364
700 1 $a Jiraskova, Galina. $3 3502365
700 1 $a Konstantinidis, Stavros. $3 3338332
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 11612. $3 3502366
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-23247-4
950 $a Computer Science (SpringerNature-11645)