Author:
Delaney Aidan,Stapleton Gem,Taylor John,Thompson Simon
Funder
Defining Regular Languages
Sketching Euler Diagrams
Subject
Computer Science Applications,Human-Computer Interaction,Language and Linguistics
Reference23 articles.
1. Janusz A. Brzozowski, Hierarchies of aperiodic languages, RAIRO—Theoretical Informatics and Applications, 1976, pp. 33–49.
2. Weak second order arithmetic and finite automata;Richard Büchi;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik,1960
3. Peter Chapman, Gem Stapleton, Introducing second order spider diagrams for defining regular languages, in: Proceedings of the Symposium on Visual Languages and Human-Centric Computing, IEEE, 2010, pp. 159–167.
4. Aidan Delaney, Gem Stapleton, Spider diagrams of order, in: Proceedings of the International Workshop on Visual Languages and Logic, vol. 274, CUER, September 2007, pp. 27–39.
5. Aidan Delaney, John Taylor, Simon Thompson, Spider diagrams of order and a hierarchy of star-free regular languages, in: Proceedings of the International Conference on the Theory and Application of Diagrams, Springer, 2008, pp. 172–187.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献