Experimental Evaluation of Classical Automata Constructions
From MaRDI portal
Publication:5387853
DOI10.1007/11591191_28zbMath1143.68443OpenAlexW1588454361MaRDI QIDQ5387853
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11591191_28
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (22)
Brzozowski type determinization for fuzzy automata ⋮ Using SAT solvers for synchronization issues in non-deterministic automata ⋮ Random Deterministic Automata ⋮ On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism ⋮ Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic ⋮ Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification ⋮ Nondeterministic Moore automata and Brzozowski's minimization algorithm ⋮ Optimized temporal monitors for SystemcC ⋮ Parametric random generation of deterministic tree automata ⋮ On minimal realization for a fuzzy language and Brzozowski’s algorithm ⋮ Hopcroft’s Algorithm and Cyclic Automata ⋮ Theory of átomata ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Algebra-coalgebra duality in brzozowski's minimization algorithm ⋮ Five Determinisation Algorithms ⋮ Nondeterministic Moore Automata and Brzozowski’s Algorithm ⋮ Büchi Complementation and Size-Change Termination ⋮ A Challenging Family of Automata for Classical Minimization Algorithms ⋮ Random Generation of Deterministic Tree (Walking) Automata ⋮ Random Models for Evaluating Efficient Büchi Universality Checking ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ A verification-driven framework for iterative design of controllers
Uses Software
This page was built for publication: Experimental Evaluation of Classical Automata Constructions
