( en | de | ru )

 

Disambiguation of "Crespi-Reghizzi, Stefano"

Author of the publication

copydeleteadd this publication to your clipboard
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages.

, , and . Log. Methods Comput. Sci., (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Karin Crespi

Stefano Meini

Stefano Cracolici

Giovanni Stefano

Stefano Carignano

 

Other publications of authors with the same name

Formal Languages and Compilation.. Texts in Computer Science Springer, (2009)From Regular to Strictly Locally Testable Languages., and . Int. J. Found. Comput. Sci., 23 (8): 1711-1728 (2012)Deque automata, languages, and planar graph representations., and . Theor. Comput. Sci., (2020)Breath and Depth Grammars and Deque Automata., , , and . Int. J. Found. Comput. Sci., 1 (3): 219-232 (1990)Erratum: A Decidability Theorem for a Class of Vector-Addition Systems., and . Inf. Process. Lett., 3 (5): 164 (1975)see: Inf. Process. Lett. 3(3): 78-80 (1975).Fair First Languages and Parallel Programme Schemes., , , and . Developments in Language Theory, page 389-418. World Scientific, Singapore, (1993)Toward a theory of input-driven locally parsable languages., , , and . Theor. Comput. Sci., (2017)Software Prototyping by Relational Techniques: Experiences with Program Construction Systems., , , and . IEEE Trans. Software Eng., 14 (11): 1597-1609 (1988)Consensual Definition of Languages by Regular Sets., and . LATA, volume 5196 of Lecture Notes in Computer Science, page 196-208. Springer, (2008)The Missing Case in Chomsky-Schützenberger Theorem., and . LATA, volume 9618 of Lecture Notes in Computer Science, page 345-358. Springer, (2016)