Abstract
We give a Kleene-type operational characterization of Muller context-free languages (MCFLs) of well-ordered and scattered words.
The publication is supported by the European Union and co-funded by the European Social Fund. Project title: “Telemedicine-focused research activities on the field of Matematics, Informatics and Medical sciences”, Project number: TAMOP-4.2.2.A-11/1/KONV-2012-0073.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Bakker, J.W., Scott, D.: A theory of programs. IBM Seminar Vienna (August 1969)
Bedon, N.: Finite automata and ordinals. Theoretical Computer Science 156, 119–144 (1996)
Bedon, N., Bès, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science – Theory and Applications. LNCS, vol. 5010, pp. 76–85. Springer, Heidelberg (2008)
Bekić, H.: Definable operations in general algebras, and the theory of automata and flowcharts. IBM Seminar Vienna (December 1969)
Bès, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 158–167. Springer, Heidelberg (2005)
Bloom, S.L., Ésik, Z.: Iteration Theories. EATCS Monograph Series in Theoretical Computer Science. Springer (1993)
Boasson, L.: Context-free sets of infinite words. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol. 67, pp. 1–9. Springer, Heidelberg (1979)
Bruyère, V., Carton, O.: Automata on linear orderings. J. Computer and System Sciences 73, 1–24 (2007)
Büchi, J.R.: The monadic second order theory of ω 1. In: Decidable theories, II. Lecture Notes in Math, vol. 328, pp. 1–127. Springer, Heidelberg (1973)
Choueka, Y.: Finite automata, definable sets, and regular expressions over ω n-tapes. J. Computer and System Sciences 17(1), 81–97 (1978)
Cohen, R.S., Gold, A.Y.: Theory of ω-languages, parts one and two. J. Computer and System Sciences 15, 169–208 (1977)
Courcelle, B.: Frontiers of infinite trees. Theoretical Informatics and Applications 12, 319–337 (1978)
Ésik, Z., Iván, S.: Operational characterization of scattered MCFLs. arXiv:1304.6388 [cs.FL]
Ésik, Z., Iván, S.: Büchi context-free languages. Theoretical Computer Science 412, 805–821 (2011)
Ésik, Z., Iván, S.: On Muller context-free grammars. Theoretical Computer Science 416, 17–32 (2012)
Ésik, Z., Iván, S.: Hausdorff rank of scattered context-free linear orders. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 291–302. Springer, Heidelberg (2012)
Ésik, Z., Okawa, S.: On context-free languages of scattered words. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 142–153. Springer, Heidelberg (2012)
Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Transactions on Computational Logic (TOCL) 6, 675–700 (2005)
Muller, R.: Infinite sequences and finite machines. In: 4th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 3–16. IEEE Computer Society (1963)
Nivat, M.: Sur les ensembles de mots infinis engendrés par une grammaire algébrique (French). Theoretical Informatics and Applications 12, 259–278 (1978)
Perrin, D., Pin, J.-E.: Infinite Words. Elsevier (2004)
Rosenstein, J.G.: Linear Orderings. Academic Press (1982)
Wojciechowski, J.: Classes of transfinite sequences accepted by finite automata. Fundamenta Informaticae 7, 191–223 (1984)
Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae 8, 379–396 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ésik, Z., Iván, S. (2013). Operational Characterization of Scattered MCFLs. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-38771-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38770-8
Online ISBN: 978-3-642-38771-5
eBook Packages: Computer ScienceComputer Science (R0)