Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata

TL;DR

This paper introduces a framework for uniformly generating deterministic real-time accessible pushdown automata, including a polynomial-time algorithm for random generation with fixed size, and studies how acceptance conditions affect reachability.

Contribution

It presents a novel framework and polynomial-time algorithm for the random generation of deterministic real-time accessible pushdown automata, analyzing acceptance condition impacts.

Findings

Polynomial-time algorithm for random generation

Acceptance condition influences reachability

Framework enables uniform automata generation

Abstract

This papers presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate a pushdown automaton having a fixed stack operations total size is proposed. The influence of the accepting condition (empty stack, final state) on the reachability of the generated automata is investigated.