Finite transducers and nondeterministic state complexity of regular languages

DOI10.3103/S1066369X10060034zbMath1207.68199OpenAlexW2059235523MaRDI QIDQ1956627

G. A. Povarov

Publication date: 23 September 2010

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x10060034

zbMATH Keywords

regular languagefinite transducerdescriptive complexitynondeterministic finite automatonnondeterministic state complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Descriptional Complexity of Error Detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection and union of regular languages and state complexity
• Finding Lower Bounds for Nondeterministic State Complexity Is Hard
• Descriptional Complexity of Nondeterministic Finite Automata

This page was built for publication: Finite transducers and nondeterministic state complexity of regular languages