THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES

DOI10.1142/S0129054110007398zbMath1205.68189OpenAlexW2070683796MaRDI QIDQ3586401

Cyril Nicaud, Frédérique Bassino, Laura Giambruno

Publication date: 6 September 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007398

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

More on Deterministic and Nondeterministic Finite Cover Automata ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ More on deterministic and nondeterministic finite cover automata

Cites Work

• Unnamed Item
• Unnamed Item
• The state complexities of some basic operations on regular languages
• Complexity of the Frobenius problem
• On the average state and transition complexity of finite languages
• Parsing with a finite dictionary

This page was built for publication: THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES