Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Formal Languages (F.4.3)
  Formal Languages (F.4.3) See Reviews  
Subject Descriptors:
Algebraic Language Theory (116)
Classes Defined By Grammars Or Automata (122)
Classes Defined By Resource-Bounded Automata (7)
Decision Problems (50)
Operations On Languages (31)
Proper Nouns:
ACP (1)
CCS (2)
Reviews limited to:

Reviews about "Formal Languages (F.4.3)":
Process algebras for Petri nets: the alphabetization of distributed systems
Gorrieri R., Springer International Publishing, New York, NY, 2017. 302 pp.  Type: Book (978-3-319555-58-4)
An effective characterization of the alternation hierarchy in two-variable logic
Krebs A., Straubing H. ACM Transactions on Computational Logic 18(4): 1-22, 2017.  Type: Article
Non-recursive trade-offs between two-dimensional automata and grammars
Průša D. Theoretical Computer Science 610, Part A, 121-132, 2016.  Type: Article
On bounded languages and reversal-bounded automata
Ibarra O., Ravikumar B. Information and Computation 24630-42, 2016.  Type: Article
Ultrafilters on words for a fragment of logic
Gehrke M., Krebs A., Pin J. Theoretical Computer Science 610, Part A, 37-58, 2016.  Type: Article
Multipass automata and group word problems
Ceccherini-Silberstein T., Coornaert M., Fiorenzi F., Schupp P., Touikan N. Theoretical Computer Science 600(C): 19-33, 2015.  Type: Article
Language equivalence of probabilistic pushdown automata
Forejt V., Jančar P., Kiefer S., Worrell J. Information and Computation 2371-11, 2014.  Type: Article
Related Topics
F.4.3 Formal Languages
  - Formal Definitions And Theory
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy