Results 231 to 240 of about 2,186 (279)
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Teaching-learning methodology for formal languages and automata theory
2015 IEEE Frontiers in Education Conference (FIE), 2015Formal languages and automata (FLA) theory have fundamental relevance to the base of knowledge in the computer science area, especially focusing on scientific education. Usually presented by a discipline, the teaching-learning process of FLA is characterized by the high level of abstraction, and it is considered difficult due to the complexity of ...
Gabriel Spadon de Souza +3 more
openaire +3 more sources
Automata Theory and Formal Theory Languages
In this book we present some basic notions and results on Automata Theory, Formal 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. For the
Alberto Pettorossi
openaire +3 more sources
Didactic strategies for promoting significant learning in formal languages and automata theory
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, 2004An undergraduate course in Formal Languages and Automata Theory (FLAT) involves different topics that are core to the CS curricula and whose level of abstraction makes them difficult both to teach and to learn. Such difficulty stems from the complexity of the abstract notions involved and the required mathematical background.
Carlos I. Chesñevar +2 more
exaly +5 more sources
Learning difficulties experienced by students in a course on formal languages and automata theory
ACM SIGCSE Bulletin, 2010Students taking courses on formal languages and automata theory (FLAT) usually do not find these courses interesting and experience difficulty in grasping the different concepts. While there has been a vast amount of research into methodologies to assist students to conceptualize FLAT topics, there has been no research into the actual learning ...
Nelishia Pillay
openaire +3 more sources
Automata Theory and Formal Languages
Undergraduate Topics in Computer Science, 2022exaly +4 more sources
Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory
Lecture Notes in Computer Science, 2014An important direction of computational and formal linguistics is to find good (mathematical and computational) models to describe linguistic phenomena. These models can also help to understand language acquisition, thinking and other mental activities. In this paper we consider finite automata with translucent letters.
Nagy, Benedek, Kovacs, Laszlo
openaire +3 more sources
Increasing interaction and support in the formal languages and automata theory course
ACM SIGCSE Bulletin, 2007The introduction of educational software such as JFLAP into the course Formal Languages and Automata (FLA) has created a learning environment with automatic feedback on theoretical topics. In this paper we show how we further increase the interaction in the FLA course with the expansion of additional theoretical topics in JFLAP, and how we have added ...
Susan H. Rodger +2 more
openaire +3 more sources
Activity based teaching learning in formal languages and automata theory - An experience
2012 IEEE International Conference on Engineering Education: Innovative Practices and Future Trends (AICERA), 2012The course on finite automata and formal languages is important in the computer science and engineering curriculum as this course is a prerequisite for system software and compiler design courses and also the concepts learnt in this course are widely applicable in the computer science and related engineering fields.
M Vijayalaskhmi, K.G Karibasappa
openaire +3 more sources
A Second Course in Formal Languages and Automata Theory
2008Written for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and ...
openaire +4 more sources

