More on Deterministic and Nondeterministic Finite Cover Automata

DOI10.1007/978-3-319-22360-5_10zbMath1465.68145OpenAlexW1198001383MaRDI QIDQ2947414

Hermann Gruber, Sebastian Jakobi, Markus Holzer

Publication date: 23 September 2015

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A lower bound technique for the size of nondeterministic finite automata
• A maxmin problem on finite automata
• Intersection and union of regular languages and state complexity
• On the average state and transition complexity of finite languages
• Minimizing nfa's and regular expressions
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES
• Finding Lower Bounds for Nondeterministic State Complexity Is Hard
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• Non-Deterministic Finite Cover Automata
• Similarity relations and cover automata
• FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: More on Deterministic and Nondeterministic Finite Cover Automata