Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata

DOI10.3233/FI-2013-802zbMath1281.68146OpenAlexW1737601775MaRDI QIDQ4914313

Zdeněk Sawa

Publication date: 18 April 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-802

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ Counting problems for parikh images

This page was built for publication: Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata