Descriptional and computational complexity of the circuit representation of finite automata

DOI10.1007/978-3-319-77313-1_8zbMATH Open1504.68119OpenAlexW2793976475MaRDI QIDQ1647686FDOQ1647686

Authors: Māris Valdats 

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-77313-1_8

Recommendations

• Boolean circuit complexity of regular languages
• Minimal NFA Problems are Hard
• The parallel complexity of finite-state automata problems
• scientific article; zbMATH DE number 176769
• NFA-to-DFA trade-off for regular operations

Mathematics Subject Classification ID

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

Cited In (8)

• Transition function complexity of finite automata
• Effective theories for circuits and automata
• Title not available (Why is that?)
• Descriptional Complexity of Operations on Alternating and Boolean Automata
• Boolean circuit complexity of regular languages
• Descriptional and computational complexity of finite automata -- a survey
• Title not available (Why is that?)
• On the descriptional complexity of Watson-Crick automata

This page was built for publication: Descriptional and computational complexity of the circuit representation of finite automata

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