Algorithms
Languages, automata, and logic
Handbook of formal languages, vol. 3
On syntactic congruences for &ohgr;-languages
Theoretical Computer Science - Special issue: formal language theory
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Experiments with deterministic ω-automata for formulas of linear temporal logic
Theoretical Computer Science - Implementation and application of automata
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Don't care words with an application to the automata-based approach for real addition
Formal Methods in System Design
A generalization of Cobham's theorem to automata over real numbers
Theoretical Computer Science
A Generalization of Semenov's Theorem to Automata over Real Numbers
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Mechanizing the powerset construction for restricted classes of ω-automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Optimizing winning strategies in regular infinite games
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Don't care words with an application to the automata-based approach for real addition
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Minimising deterministic Büchi automata precisely using SAT solving
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
On the succinctness of nondeterminism
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Automata-Based symbolic representations of polyhedra
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
LTL to büchi automata translation: fast and more deterministic
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Optimized inlining of runtime monitors
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.89 |
We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n logn), where n is the number of states of the automaton.