State Complexity of Prefix Distance of Subregular Languages

DOI10.1007/978-3-319-41114-9_15zbMATH Open1476.68136OpenAlexW2482750740MaRDI QIDQ2829982FDOQ2829982

Timothy Ng, David Rappaport, Kai Salomaa

Publication date: 9 November 2016

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

Full work available at URL: https://hal.inria.fr/hal-01633944/file/416473_1_En_15_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Distances between languages and reflexivity of relations
• Encyclopedia of Distances
• A Second Course in Formal Languages and Automata Theory
• Descriptional and computational complexity of finite automata -- a survey
• Determination of finite automata accepting subregular languages
• The magic number problem for subregular language families
• Nondeterministic State Complexity of Star-Free Languages
• On NFAs where all states are final, initial, or both
• State Complexity of Prefix Distance

Cited In (1)

• Parameterized Prefix Distance between Regular Languages

This page was built for publication: State Complexity of Prefix Distance of Subregular Languages

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