Titlebook: Language and Automata Theory and Applications; Third International Adrian Horia Dediu,Armand Mihai Ionescu,Carlos Mar Conference proceedin

Clique

书目名称Language and Automata Theory and Applications影响因子(影响力)




书目名称Language and Automata Theory and Applications影响因子(影响力)学科排名




书目名称Language and Automata Theory and Applications网络公开度




书目名称Language and Automata Theory and Applications网络公开度学科排名




书目名称Language and Automata Theory and Applications被引频次




书目名称Language and Automata Theory and Applications被引频次学科排名




书目名称Language and Automata Theory and Applications年度引用




书目名称Language and Automata Theory and Applications年度引用学科排名




书目名称Language and Automata Theory and Applications读者反馈




书目名称Language and Automata Theory and Applications读者反馈学科排名

Vaginismus

fulcrum

State Complexity of Nested Word Automataestablish a lower bound for the state complexity of Kleene star that is of a different order than the known tight state complexity bound for the star of ordinary regular languages. We survey known bounds on deterministic and nondeterministic state complexity of basic operations on regular nested word languages and discuss open problems.

系列

Refinement and Consistency of Timed Modal Specificationsefine ., an automata-based formalism combining modal and timed aspects. As a stepping stone to compositional approaches of timed systems, we define the notions of refinement and consistency, and establish their decidability.

征兵

How Many Holes Can an Unbordered Partial Word Contain?d is called . if one of its proper prefixes is compatible with one of its suffixes (here . is compatible with every letter in the alphabet); it is called . otherwise. In this paper, we investigate the problem of computing the maximum number of holes a partial word of a fixed length can have and still fail to be bordered.

SUGAR

Conference proceedings 2009 in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.

NAVEN

Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical ApplicationsThis tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts.

peak-flow

CLAN

Language and Automata Theory and Applications978-3-642-00982-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

Cytology