Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Finite Automata, Formal Logic, and Circuit Complexity
Home
Publications
Finite Automata, Formal Logic, and Circuit Complexity
Finite Automata, Formal Logic, and Circuit Complexity
Author:
HS
Howard Straubing
Howard Straubing
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 January 1994
book
Published by
Springer Nature
DOI:
10.1007/978-1-4612-0289-9
Abstract
No abstract available
Keywords
ALGORITHMS
AUTOMATA
COMPLEXITY
COMPUTER
COMPUTER SCIENCE
FORMAL LANGUAGE
FORMAL LANGUAGES
FORMAL LOGIC
LOGIC
PREDICATE LOGIC
THEORETICAL COMPUTER SCIENCE
Cited
Cited by 395 articles
Scroll to top