Automata Theory and Formal Theory Languages
2022In 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
openaire +2 more sources
Formal language recognition by stochastic cellular automata
2008Summary: We present two generalizations of Cellular Automata (CA) where transitions from one configuration to the next are no longer deterministic but depend on some element of randomization. The main topic is a model which not only takes into account the probabilities of cells being in certain states but also their dependencies.
Merkle, Daniel, Worsch, Thomas
openaire +1 more source
Using theoretical computer simulators for formal languages and automata theory
SGCS, 2003C. Chesñevar +2 more
semanticscholar +1 more source
Didactic strategies for promoting significant learning in formal languages and automata theory
Annual Conference on Innovation and Technology in Computer Science Education, 2004C. Chesñevar +2 more
semanticscholar +1 more source
Learning difficulties experienced by students in a course on formal languages and automata theory
SGCS, 2010N. Pillay
semanticscholar +1 more source
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages
2010Parallel language recognition by cellular automata (CAs) is currently an important subject in computation theory. This paper describes incremental learning of one-dimensional, bounded, one-way, cellular automata (OCAs) that recognize formal languages from positive and negative sample strings.
Katsuhiko Nakamura, Keita Imada
openaire +2 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), 2012M. Vijayalaskhmi, K. Karibasappa
semanticscholar +1 more source
SHIFT: A formalism and a programming language for dynamic networks of hybrid automata
1997SHIFT is a programming language for the specification and simulation of dynamic networks of hybrid automata. Such systems consist of components which can be created, interconnected and destroyed as the system evolves. Components exhibit hybrid behavior, consisting of continuous-time phases separated by discrete-event transitions.
Akash Deshpande +2 more
openaire +2 more sources
Programming-Based Formal Languages and Automata Theory - Design, Implement, Validate, and Prove
Texts in Computer ScienceMarco T. Morazán
semanticscholar +1 more source
A SIMULATOR FOR TEACHING AUTOMATAS AND FORMAL LANGUAGES - FLyA
Proceedings of the 11th International Conference on Enterprise Information, 2009Héctor A. Montes Venegas +3 more
openaire +2 more sources