Results 11 to 20 of about 43,033 (311)
A prolog toolkit for formal languages and automata [PDF]
ACM SIGCSE Bulletin, 2005 This paper describes the first version of PFLAT (read "P flat"), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms taught in Formal Languages and Automata Theory (FLAT) courses. By ``pedagogical implementation'' we mean on the one hand that students should be able to easily map the ...
Wermelinger, Michel, Dias, Artur Miguel
+6 more sources
A bialgebraic approach to automata and formal language theory [PDF]
Annals of Pure and Applied Logic, 2008 29 pages, fixed typos, added ...
James Worthington
+9 more sources
A course on the relationship of formal language theory to automata [PDF]
ACM SIGCSE Bulletin, 1970 This paper describes the second course in a graduate sequence in Computer Science given at the University of Tennessee, Knoxville. The purpose of this sequence is to provide students with a theoretical base in formal language theory for understanding and interpretation of concepts and relationships in programming and automata theory.
Robert M. Aiken
openaire +3 more sources
Proceedings 14th International Conference on Automata and Formal Languages
arXiv: Formal Languages and Automata Theory, 2014 The 14th International Conference Automata and Formal Languages (AFL 2014) was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The conference was organized by the Department of Foundations of Computer Science of the University of Szeged. Topics of interest covered the theory and applications of automata and formal languages and related
Zoltán Fülöp, Zoltán Ésik
+7 more sources
Functional Automata - Formal Languages for Computer Science Students [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science.
Marco T. Morazán, Rosario Antunez
openaire +4 more sources
Proceedings of the 16th International Conference on Automata and Formal Languages
, 2023 The 16th International Conference on Automata and Formal Languages (AFL 2023) was held in Eger, September 5-7, 2023. It was organized by the Eszterházy Károly Catholic University of Eger, Hungary, and the University of Szeged, Hungary. Topics of interest covered the theory and applications of automata and formal languages and related areas. This volume
Gazdag, Zsolt +2 more
+5 more sources
Proceedings 15th International Conference on Automata and Formal Languages
arXiv: Formal Languages and Automata Theory, 2017 The 15th International Conference on Automata and Formal Languages (AFL 2017) was held in Debrecen, Hungary, from September 4 to 6, 2017. The conference was organized by the Faculty of Informatics of the University of Debrecen and the Faculty of Informatics of the E\"otv\"os Lor\'and University of Budapest.
Erzsébet Csuhaj-Varjú +2 more
+8 more sources
J.UCS Special Issue on Formal Languages and Automata (WFLA) [PDF]
, 1999 J.UCS Special Issue on Formal Languages and Automata (WFLA)
Alexandru Mateescu
openaire +3 more sources
A collection of tools for making automata theory and formal languages come alive [PDF]
ACM SIGCSE Bulletin, 1997 We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; Pâté for parsing restricted and unrestricted grammars and transforming context-free ...
Magdalena Procopiuc +6 more
+5 more sources
Automata Theory and Formal Languages [PDF]
, 2008 In this book we present some basic notions and results on Automata Theory, For- mal Language Theory, Computability Theory, and Parsing Theory. In particular, we consider the class of regular languages which are related to the class of finite automata, and the class of the context-free languages which are related to the class of pushdown automata.
PETTOROSSI, ALBERTO
openaire +6 more sources