Nondeterministic State Complexity of Proportional Removals

DOI10.1007/978-3-642-39310-5_11zbMath1304.68103OpenAlexW2179921374MaRDI QIDQ2843088

Kai Salomaa, Alexandros Palioudakis, Daniel Goč

Publication date: 9 August 2013

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_11

zbMATH Keywords

finite automatanondeterminismstate complexityproportional removals

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The State Complexity of Permutations on Finite Languages over Binary Alphabets

This page was built for publication: Nondeterministic State Complexity of Proportional Removals