2000 character limit reached
Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata (1512.05881v1)
Published 18 Dec 2015 in cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
