Skip to main content Accessibility help
×
×
Home

Decidability of regular language genus computation

  • Guillaume Bonfante (a1) and Florian L. Deloup (a2)

Abstract

This article continues the study of the genus of regular languages that the authors introduced in a 2013 paper (published in 2018). In order to understand further the genus g(L) of a regular language L, we introduce the genus size of |L|gen to be the minimal size of all finite deterministic automata of genus g(L) computing L.We show that the minimal finite deterministic automaton of a regular language can be arbitrarily far away from a finite deterministic automaton realizing the minimal genus and computing the same language, in terms of both the difference of genera and the difference in size. In particular, we show that the genus size |L|gen can grow at least exponentially in size |L|. We conjecture, however, the genus of every regular language to be computable. This conjecture implies in particular that the planarity of a regular language is decidable, a question asked in 1976 by R. V. Book and A. K. Chandra. We prove here the conjecture for a fairly generic class of regular languages having no short cycles. The methods developed for the proof are used to produce new genus-based hierarchies of regular languages and in particular, we show a new family of regular languages on a two-letter alphabet having arbitrary high genus.

Copyright

Corresponding author

*Corresponding author. Email: florian.deloup@math.univ-toulouse.fr

References

Hide All
Book, R. V. and Chandra, A. K. (1976). Inherently nonplanar automata. Acta Informatica 6 (1) 8994.
Bonfante, G. and Deloup, F. (2018). The genus of regular languages. Mathematical Structures in Computer Science 18 (1) 1444.
Bezáková, I. and Pál, M. (1999). Planar finite automata. Technical report, Student Science Conference, Comenius University.
Eilenberg, S. (1974). Automata, Languages and Machines, vol. A. Academic Press, New York.
Gross, J. and Tucker, T. W. (2001). Topological Graph Theory, Dover Publications.
Mohar, B. (1996). Embedding graphs in an arbitrary surface in linear time. In: Proc. 28th Ann. ACM STOC, Philadelphia, ACM Press, 392397.
Ringel, G. and Youngs, J. W. T. (1968). Solution of the Heawood map-coloring problem. Proc. Nat. Acad. Sci. U.S.A. 60 438445.
Sakarovitch, J. (2009). Elements of Automata Theory. Cambridge University Press, Cambridge.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed