Titlebook: Descriptional Complexity of Formal Systems; 18th IFIP WG 1.2 Int Cezar Campeanu,Florin Manea,Jeffrey Shallit Conference proceedings 2016 IF

惡夢

書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)




書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度




書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems被引頻次




書目名稱Descriptional Complexity of Formal Systems被引頻次學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems年度引用




書目名稱Descriptional Complexity of Formal Systems年度引用學(xué)科排名




書目名稱Descriptional Complexity of Formal Systems讀者反饋




書目名稱Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名

打折

沒有希望

https://doi.org/10.1007/978-3-031-41574-6We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.

無能力之人

Computer Supported Cooperative WorkWe show that it is decidable given an MSO-definable property . of countable words and a Muller context-free grammar ., whether every word in the language generated by . satisfies ..

起草

Completely Reachable Automata,We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.

Malcontent

Malcontent

Self-Verifying Finite Automata and Descriptional Complexity,We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.

apropos

penance

特別容易碎

The Irreplaceable Experience of Fieldworkd a minimal .-state DFA ., both?defined over an alphabet . with ., such that the minimal DFA for the language .(.).(.) has exactly . states. This improves a?similar result in the literature that uses an exponential alphabet.