Efficient construction of semilinear representations of languages accepted by unary NFA

DOI10.1007/978-3-642-15349-5_12zbMATH Open1287.68100OpenAlexW1659549423MaRDI QIDQ3584969FDOQ3584969

Authors: Zdeněk Sawa 

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata
• Unary finite automata vs. arithmetic progressions
• Unambiguous finite automata over a unary alphabet
• Unambiguous finite automata over a unary alphabet
• Chrobak normal form revisited, with applications

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• On Context-Free Languages
• Finite automata and unary languages
• Unary finite automata vs. arithmetic progressions

Cited In (5)

• Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata
• Deciding determinism of unary languages
• Chrobak normal form revisited, with applications
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Efficient construction of semilinear representations of languages accepted by unary NFA

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