Some bounds on the complexity of predicate recognition by finite automata

DOI10.1016/S0022-0000(76)80005-0zbMath0349.02028MaRDI QIDQ1234679

Yuri Breitbart

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

On the size of binary decision diagrams representing Boolean functions

Cites Work

• Error Detecting and Error Correcting Codes
• Unnamed Item