Results 271 to 280 of about 47,236 (329)

Teaching Formal Languages with Visualizations and Auto-Graded Exercises

Technical Symposium on Computer Science Education, 2021
The material taught in a Formal Languages and Automata (FLA) course is mathematical in nature and requires students to practice proofs and algorithms to understand the content. Traditional FLA textbooks are heavy on prose, and homework typically consists
Mostafa Mohammed, C. Shaffer, S. Rodger
semanticscholar   +1 more source

Automata Theory and Formal Theory Languages

2022
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
openaire   +2 more sources

Formal language recognition by stochastic cellular automata

2008
Summary: 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

Learning difficulties experienced by students in a course on formal languages and automata theory

SGCS, 2010
N. Pillay
semanticscholar   +1 more source

Using theoretical computer simulators for formal languages and automata theory

SGCS, 2003
C. Chesñevar, Maria Laura Cobo, W. Yurcik   +2 more
semanticscholar   +1 more source

Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages

2010
Parallel 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

Didactic strategies for promoting significant learning in formal languages and automata theory

Annual Conference on Innovation and Technology in Computer Science Education, 2004
C. Chesñevar, María Paula González, Ana Gabriela Maguitman   +2 more
semanticscholar   +1 more source

SHIFT: A formalism and a programming language for dynamic networks of hybrid automata

1997
SHIFT 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, Pravin Varaiya, Aleks Göllü   +2 more
openaire   +2 more sources

A Second Course in Formal Languages and Automata Theory

, 2008
Jeffrey Shallit
semanticscholar   +1 more source

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), 2012
M. Vijayalaskhmi, K. Karibasappa
semanticscholar   +1 more source