Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Cezar Campeanu"'
Autor:
Cezar Câmpeanu
This book constitutes the proceedings of the 23rd International Conference on Implementation and Application of Automata, CIAA 2018, held in Charlottetown, PE, Canada, in July/August 2018.The 23 regular papers presented in this book together with 4 i
Autor:
Giovanni Pighizzini, Cezar Câmpeanu
This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully review
his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were car
Publikováno v:
International Journal of Foundations of Computer Science. 13:83-97
The concept of cover automata for finite languages was formally introduced in [3]. Cover automata have been studied as an efficient representation of finite languages. In [3], an algorithm was given to transform a DFA that accepts a finite language t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40f1d4fb60265b4ffcadfd01632031ec
https://doi.org/10.1142/s0129054102000960
https://doi.org/10.1142/s0129054102000960
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540428121
WIA
WIA
The state complexity of basic operations on regular languages has been studied in [9,10,11]. Here we focus on finite languages. We show that the catenation of two finite languages accepted by an m- state and an n-state DFA, respectively, with m > n i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e513dd1d7052a4a2b08f43c89ad0c24
https://doi.org/10.1007/3-540-45526-4_6
https://doi.org/10.1007/3-540-45526-4_6
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540666523
Workshop on Implementing Automata
Workshop on Implementing Automata
A cover-automaton A of a finite language L ⊆ Σ* is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller siz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33c96c831474381847db89563a8f6744
https://doi.org/10.1007/3-540-48057-9_4
https://doi.org/10.1007/3-540-48057-9_4
Autor:
Cezar Câmpeanu
Publikováno v:
Axioms, Vol 10, Iss 4, p 338 (2021)
Deterministic Finite Cover Automata (DFCA) are compact representations of finite languages. Deterministic Finite Automata with “do not care” symbols and Multiple Entry Deterministic Finite Automata are both compact representations of regular lang
Externí odkaz:
https://doaj.org/article/1bf4adbac60d4847be49f75efe33c7fc
Autor:
Cezar Câmpeanu
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 162-173 (2014)
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA '98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language, Nondeterministic Finite
Externí odkaz:
https://doaj.org/article/68e92e945fc44f4e8e97d7d090808973