Some remarks on non-algebraic adherences

DOI10.1016/0304-3975(82)90080-9zbMath0528.68052OpenAlexW2078024673WikidataQ126812550 ScholiaQ126812550MaRDI QIDQ786543

Sorin Istrail

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90080-9

zbMATH Keywords

adherencesChomsky hierarchy of adherencescomputation shapesprogram schemes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Infinite-word languages and continuous mappings ⋮ Valuations of languages, with applications to fractal geometry ⋮ Topology on words ⋮ Nivat's processing systems: decision problems related to protection and synchronization ⋮ On infinite words obtained by selective substitution grammars

Cites Work

• Adherences of languages
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item