Sciweavers

371 search results - page 5 / 75
» Pushdown Automata Simulator
Sort
View
SIGCSE
1997
ACM
158views Education» more  SIGCSE 1997»
15 years 3 months ago
A collection of tools for making automata theory and formal languages come alive
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 a...
Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider...
FSEN
2009
Springer
15 years 6 months ago
A Process-Theoretic Look at Automata
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Lutti...
FASE
2010
Springer
15 years 3 months ago
An Automata-Theoretic Approach to Hardware/Software Co-verification
Abstract. In this paper, we present an automata-theoretic approach to Hardware/Software (HW/SW) co-verification. We designed a co-specification framework describing HW/SW systems; ...
Juncao Li, Fei Xie, Thomas Ball, Vladimir Levin, C...
MFCS
2007
Springer
15 years 5 months ago
Minimizing Variants of Visibly Pushdown Automata
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
Patrick Chervet, Igor Walukiewicz
CONCUR
2008
Springer
15 years 1 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...