Computing languages by (bounded) local sets

DOI10.1007/3-540-45007-6_24MaRDI QIDQ4452071zbMATH OpenFDO

Authors Dora Giammarresi

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100304.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Strict \(\text{LT}_2\) : regular :: local : recognizable
• Formal languages defined by the underlying structure of their words
• Fuzzy local languages
• On the recognition of families of graphs with local computations
• Locally finite languages

Cited in

(4)

• Bounded D0L languages
• A logical approach to locality in pictures languages
• scientific article; zbMATH DE number 1916672 (Why is no real title available?)
• Local languages and the Berry-Sethi algorithm

This page was built for publication: Computing languages by (bounded) local sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452071)