Systolic Tree Omega-Languages.

The class of -languages recognized by systolic tree automata is introduced. That class extends the class of Büchi -languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable. A characterization of systolic tree -languages in terms of a (suitable) concatenation of (finitary) systolic tree languages is also provided.

Country

Italy

Related Organizations

University Federico II of Naples
Italy
University of Trieste
Italy

Keywords

omega-language, systolic automata, formal language, omega-languages; formal languages; automata theory; systolic automata, omega-languages, formal languages, automata theory

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Related to Research communities

Aurora Universities Network

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now