Regular splicing languages must have a constant

P Bonizzoni, N Jonoska - International Conference on Developments in …, 2011 - Springer
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …
被引用次数：15 相关文章

Regular Splicing Languages Must Have

P Bonizzoni, N Jonoska - … , DLT 2011, Milan, Italy, July 19-22 …, 2011 - books.google.com
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …

Regular Splicing Languages Must Have a Constant

P Bonizzoni, N Jonoska - Springer
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …

Regular Splicing Languages Must Have a Constant

P Bonizzoni, N Jonoska - Lecture Notes in Computer Science, 2011 - boa.unimib.it
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …

Regular Splicing Languages Must Have a Constant

P Bonizzoni, N Jonoska - Developments in Language Theory - infona.pl
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …

Regular splicing languages must have a constant

P Bonizzoni, N Jonoska - … of the 15th international conference on …, 2011 - dl.acm.org
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …

Regular Splicing Languages Must Have a Constant

P Bonizzoni, N Jonoska - … , DLT 2011, Milan, Italy, July 19-22 …, 2011 - books.google.com
In spite of wide investigations of finite splicing systems in formal language theory, basic
questions, such as their characterization, remain unsolved. In search for understanding the …

[引用][C] Regular Splicing Languages Must Have a Constant

P Bonizzoni, N Jonoska - Developments in Language Theory, 2011 - Springer