The state complexity of ^*L and its connection with temporal logic

DOI10.1016/0020-0190(96)00044-0MaRDI QIDQ2423779zbMATH OpenOpenAlexFDO

Authors J.-C. Birget

Publication date 20 June 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00044-0

Mathematics Subject Classification ID

Temporal logic (03B44) Formal languages and automata (68Q45)

Cites work

• Alternation
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Intersection and union of regular languages and state complexity
• On equations for regular languages, finite automata, and sequential networks
• On the expressive power of temporal logic
• Partial orders on words, minimal elements of regular languages, and state complexity
• Succinct representation of regular languages by Boolean automata
• Succinct representation of regular languages by Boolean automata. II

Cited in

(4)

• Descriptional complexity of the forever operator
• Universal disjunctive concatenation and star
• The state complexity of \(L^{2}\) and \(L^k\)
• On the state complexity of closures and interiors of regular languages with subwords and superwords

This page was built for publication: The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423779)