×
Boasson, Luc; Nivat, Maurice

Adherences of languages. (English) Zbl 0471.68052

J. Comput. Syst. Sci. 20, 285-309 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0471.68052

Cited in 2 Reviews
Cited in 77 Documents

MSC:

68Q45 Formal languages and automata

Keywords:

context-free sets of finite and infinite words; families of sets of infinite words
PDF BibTeX XML Cite
\textit{L. Boasson} and \textit{M. Nivat}, J. Comput. Syst. Sci. 20, 285--309 (1980; Zbl 0471.68052)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Arnold, A.; Nivat, M., Non deterministic recursive programs, (), 12-21
[2] Chomsky, N.; Schützenberger, M.P., The algebraic theory of context-free languages, Computer programming and formal languages, (1963) · Zbl 0148.00804
[3] Cohen, R.; Gold, A., Theory of ω-languages, I, II, J. comput. system sci., 15, 169-208, (1977)
[4] Courcelle, B.; Nivat, M., Algebraic families of interpretations, () · Zbl 0384.68016
[5] Dugundji, J., Topology, (1976), Allyn & Bacon Boston
[6] Eilenberg, S., ()
[7] Linna, M., On ω-words and ω-computations, Ann. univ. turkuensis, (1975) · Zbl 0319.68046
[8] Nivat, M., Mots infinis engendres par une grammaire algébrique, R.A.I.R.O. inform. théor., 11, 311-327, (1977) · Zbl 0371.68025
[9] Nivat, M., Sur LES ensembles de mots infinis engendrés par une grammaire algébrique, R.A.I.R.O. inform. théor., 12, 259-278, (1978) · Zbl 0387.68050
[10] Schützenberger, M.P., Push-down automata and context-free languages, Inform. contr., 6, 246-264, (1963) · Zbl 0123.12502
[11] Scott, D., Outline of a mathematical theory of computation, (1972), Oxford Programming Research Group, Memo · Zbl 0419.68076
[12] Vuillemin, J., Syntaxe, sémantique et axiomatique d’un langage de programmation, () · Zbl 0327.68006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.