Language and Automata Theory and Applications
Language and Automata Theory and Applications
复制标题
语言与自动机理论与应用
DOI:
10.1007/978-3-642-37064-9_8
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
Atminas A
中科院分区:
文献类型:
--
作者:
Atminas A
A language is factorial if it is closed under taking factors (i.e. contiguous subwords). Every factorial language can be described by an antidictionary, i.e. a minimal set of forbidden factors. We show that the problem of deciding whether a factorial language given by afiniteantidictionary is well-quasi-ordered under the factor containment relation can be solved in polynomial time.
登录
查看更多内容
DOI:
10.1016/j.tcs.2007.09.022
发表时间:
2005
期刊:
Theor. Comput. Sci.
影响因子:
--
作者:
A. Murawski;I. Walukiewicz
通讯作者:
I. Walukiewicz
DOI:
--
发表时间:
2008
期刊:
International Workshop on Graph-Theoretic Concepts in Computer Science
影响因子:
--
作者:
Benny Godlin;Tomer Kotek;J. Makowsky
通讯作者:
J. Makowsky
DOI:
--
发表时间:
2013
期刊:
J. Discrete Algorithms
影响因子:
--
作者:
R. Kolpakov;Mikhail Podolskiy;M. Posypkin;Nickolay Khrapov
通讯作者:
Nickolay Khrapov
DOI:
--
发表时间:
2014
期刊:
SR
影响因子:
--
作者:
V. Bruyère;E. Filiot;Mickael Randour;Jean
通讯作者:
Jean
DOI:
--
发表时间:
2012
期刊:
International Conference on Computer Aided Verification
影响因子:
--
作者:
William R. Harris;S. Jha;T. Reps
通讯作者:
T. Reps