GitHub

A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA)

A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA) ...
Nature

Automata Theory and Temporal Logic in Data Processing

Automata theory and temporal logic together form a foundational pillar in the design and analysis of data processing systems. At its core, automata theory provides abstract models—ranging from finite ...
IEEE

Non-deterministic Timed Pushdown Automata-Based Testing Evaluated by Mutation

Abstract: This paper is about conformance testing of non deterministic timed pushdown automata with inputs and outputs (TPAIO), that specify both stack and clock constraints. It proposes a novel ...
IEEE

Conformance Testing for Non-deterministic Timed Pushdown Automata with Deadlines

Abstract: This paper is about conformance testing of non-deterministic timed pushdown automata (TPAIO), with urgency modelled as deadlines put on the transitions. The deadlines impose time progress ...