首页>外文会议>其他>International Conference on Descriptional Complexity of Formal Systems

International Conference on Descriptional Complexity of Formal Systems

召开年：
召开地：
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata

机译：二维自动机投影语言的识别和复杂性结果
- 作者：Taylor J. Smith;Kai Salomaa
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Language classes;
- Projection languages;
- Space complexity;
- Three-way automata;
- Two-dimensional automata;
- Two-way automata;
2.On the Generative Power of Quasiperiods

机译：论QuaSiperiods的生成权力
- 作者：Ludwig Staiger
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Quasiperiod;
- Formal language;
- Asymptotic growth;
- Polynomial;
3.Insertion-Deletion with Substitutions Ⅱ

机译：用替换插入ⅡⅡ
- 作者：Martin Vu;Henning Fernau
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Computational completeness;
- Context-sensitive;
- Insertions;
- Deletions;
- Substitutions;
4.Preface

机译：前言
- 作者：Galina Jiraskova;Giovanni Pighizzini
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
5.Mutually Accepting Capacitated Automata

机译：相互接受电容自动机
- 作者：Ravid Alon;Orna Kupferman
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
6.Bad Pictures: Some Structural Properties Related to Overlaps

机译：不好的图片：一些与重叠有关的结构性
- 作者：Marcella Anselmo;Dora Giammarresi;Maria Madonia;Carla Selmi
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Bad pictures;
- Overlap;
- Index;
7.Regular Expression Length via Arithmetic Formula Complexity

机译：通过算术公式复杂度进行正则表达长度
- 作者：Ehud Cseresnyes;Hannes Seiwert
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Regular expression;
- Lower bound;
- Arithmetic formula;
- Arithmetic circuit complexity;
- Finite language;
8.Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

机译：CRESP-METICEITION在局部有限和过去有限单调强辅作致译种的加权树自动化
- 作者：Manfred Droste;Zoltan Fueloep;David Koszo;Heiko Vogler
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Strong bimonoid;
- Semiring;
- Weighted tree automaton;
- Determinization;
- Decidability;
9.On the Power of Generalized Forbidding Insertion-Deletion Systems

机译：关于广义禁止插入删除系统的力量
- 作者：Henning Fernau;Lakshmanan Kuppusamy;Indhumathi Raman
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Insertion-deletion;
- Semi-conditional;
- Forbidding grammars;
- Descriptional complexity;
- Special Geffert Normal Form;
10.State Complexity Bounds for the Commutative Closure of Group Languages

机译：州语言换向关闭的状态复杂性界限
- 作者：Stefan Hoffmann
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- State complexity;
- Commutative closure;
- Group language;
- Permutation automaton;
11.Multiple Concatenation and State Complexity (Extended Abstract)

机译：多次级联和状态复杂性（扩展摘要）
- 作者：Jozef Jirasek;Galina Jiraskova
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
12.Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata

机译：在交替有限自动机中结合有限的平行和非季度
- 作者：Chris Keeler;Kai Salomaa
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
13.Longer Shortest Strings in Two-Way Finite Automata

机译：双向有限自动机中的较长最短字符串
- 作者：Stanislav Krymski;Alexander Okhotin
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
14.Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

机译：迭代均匀有限状态换能器：描述不确定的复杂性和双向运动
- 作者：Martin Kutrib;Andreas Malcher;Carlo Mereghetti;Beatrice Palano
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Iterated transducers;
- Nondeterminism;
- Two-way motion;
15.Descriptional Complexity of Winning Sets of Regular Languages

机译：赢得常规语言集的描述性复杂性
- 作者：Pierre Marcus;Ilkka Toermae
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- State complexity;
- Regular languages;
- Winning sets;
16.State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

机译：GF（2）-Inverse和GF（2）-STAR的状态复杂性
- 作者：Alexander Okhotin;Elizaveta Sazhneva
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
17.Complexity of Two-Dimensional Rank-Reducing Grammars

机译：二维排名还原语法的复杂性
- 作者：Daniel Prusa
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
18.Palindromic Length of Words with Many Periodic Palindromes

机译：与许多周期性的回文的回文的长度
- 作者：Josef Rukavicka
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
19.Operational Complexity of Straight Line Programs for Regular Languages

机译：用于常规语言的直线程序的操作复杂性
- 作者：Hannes Seiwert
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Regular language;
- Straight line program;
- Lower bound;
- Operational complexity;
- Shuffle;
- Constant height pushdown automaton;
20.Classifying ω-Regular Aperiodic κ-Partitions

机译：分类ω-常规非周期性κ分区
- 作者：Victor Selivanov
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Aperiodic κ-partition;
- Acceptor;
- Transducer;
- Iterated labeled tree;
- Fine hierarchy;
- Reducibility;
21.State Complexity Bounds for the Commutative Closure of Group Languages

机译：组语言的换向关闭的状态复杂性界限
- 作者：Stefan Hoffmann
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- State complexity;
- Commutative closure;
- Group language;
- Permutation automaton;
22.On the Generative Power of Quasiperiods

机译：论QuaSiperiods的生成力量
- 作者：Ludwig Staiger
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Quasiperiod;
- Formal language;
- Asymptotic growth;
- Polynomial;
23.Regular Expression Length via Arithmetic Formula Complexity

机译：通过算术公式复杂度的正则表达长度
- 作者：Ehud Cseresnyes;Hannes Seiwert
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Regular expression;
- Lower bound;
- Arithmetic formula;
- Arithmetic circuit complexity;
- Finite language;
24.Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

机译：迭代均匀有限状态传感器：非季度和双向运动的描述复杂性
- 作者：Martin Kutrib;Andreas Malcher;Carlo Mereghetti;Beatrice Palano
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Iterated transducers;
- Nondeterminism;
- Two-way motion;
25.Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata

机译：在交替有限自动机中结合有限的平行和非eterminism
- 作者：Chris Keeler;Kai Salomaa
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
26.Classifying ω-Regular Aperiodic k-Partitions

机译：分类ω-常规非周期性k分区
- 作者：Victor Selivanov
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Aperiodic k-partition;
- Acceptor;
- Transducer;
- Iterated labeled tree;
- Fine hierarchy;
- Reducibility;
27.Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

机译：Crisp-Metialization在加重局部有限和过去有限单调强辅作致辨明的
- 作者：Manfred Droste;Zoltan Fulop;David Koszo;Heiko Vogler
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Strong bimonoid;
- Semiring;
- Weighted tree automaton;
- Determinization;
- Decidability;
28.Multiple Concatenation and State Complexity (Extended Abstract)

机译：多次级联和状态复杂性（扩展摘要）
- 作者：Jozef Jirasek;Galina Jiraskova
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
29.Bad Pictures: Some Structural Properties Related to Overlaps

机译：不好的图片：一些与重叠有关的结构性
- 作者：Marcella Anselmo;Dora Giammarresi;Maria Madonia;Carla Selmi
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Bad pictures;
- Overlap;
- Index;
30.Palindromic Length of Words with Many Periodic Palindromes

机译：与许多周期性的parindromes的回文的长度
- 作者：Josef Rukavicka
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
31.On the Power of Generalized Forbidding Insertion-Deletion Systems

机译：关于广义禁止插入删除系统的力量
- 作者：Henning Fernau;Lakshmanan Kuppusamy;Indhumathi Raman
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Insertion-deletion;
- Semi-conditional;
- Forbidding grammars;
- Descriptional complexity;
- Special geffert normal form;
32.Longer Shortest Strings in Two-Way Finite Automata

机译：双向有限自动机中的较长最短字符串
- 作者：Stanislav Krymski;Alexander Okhotin
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
33.Complexity of Two-Dimensional Rank-Reducing Grammars

机译：二维排名缩减语法的复杂性
- 作者：Daniel Prusa
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
34.Insertion-Deletion with Substitutions II

机译：用替换II插入删除II
- 作者：Martin Vu;Henning Fernau
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Computational completeness;
- Context-sensitive;
- Insertions;
- Deletions;
- Substitutions;
35.State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

机译：GF（2） - vfse和gf（2）-star上的状态复杂性
- 作者：Alexander Okhotin;Elizaveta Sazhneva
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
36.Operational Complexity of Straight Line Programs for Regular Languages

机译：常规语言的直线程序的操作复杂性
- 作者：Hannes Seiwert
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Regular language;
- Straight line program;
- Lower bound;
- Operational complexity;
- Shuffle;
- Constant height pushdown automaton;
37.Descriptional Complexity of Winning Sets of Regular Languages

机译：赢得常规语言集的复杂性
- 作者：Pierre Marcus;Ilkka Torma
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- State complexity;
- Regular languages;
- Winning sets;
38.Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata

机译：二维自动机投影语言的识别和复杂性结果
- 作者：Taylor J. Smith;Kai Salomaa
- 会议名称：《International Conference on Descriptional Complexity of Formal Systems》 | 2020年
- Language classes;
- Projection languages;
- Space complexity;
- Three-way automata;
- Two-dimensional automata;
- Two-way automata;