Incremental construction of minimal deterministic finite cover automata

DOI10.1016/j.tcs.2006.07.020zbMath1153.68028MaRDI QIDQ860858

Andrei Păun, Jason R. Smith, Cezar Campeanu

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.020

zbMATH Keywords

DFA; deterministic finite cover automata (DFCA); DFCA minimization; incremental construction

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

On Testing P Systems, Learning finite cover automata from queries, More on deterministic and nondeterministic finite cover automata, Time window temporal logic, Finite state based testing of P systems, HYPER-MINIMIZATION IN O(n²), Hyper-Minimization in O(n 2)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal insertion in deterministic DAWGs
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Incremental Construction and Maintenance of Minimal Finite-State Automata
• Incremental Construction of Minimal Acyclic Finite-State Automata
• COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages