Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Formal Languages (F.4.3)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 141 Reviews about "Formal Languages (F.4.3)": Date Reviewed   Randomness and elements of decision theory applied to signals Borda M., Terebes R., Malutan R., Ilea I., Cislariu M., Miclea A., Barburiceanu S., Springer International Publishing, Cham, Switzerland, 2021. 259 pp.  Type: Book (978-3-030903-13-8) Communication and image processing systems are commonly modeled using random processes and are of immense interest in electronics engineering. This short volume attempts to provide an introduction to various topics related to this subject.... Sep 21 2023   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) This monograph relates process expressions to process models, such as labeled transition systems and Petri nets of various kinds. The models are set up in chapters 2 and 3, together with descriptions of their behavior, such as strong b... Feb 6 2019   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 Many interesting properties of words can be described in a first-order language with variables (x, y, ...) for positions and two basic properties: x < y Jul 6 2018   Non-recursive trade-offs between two-dimensional automata and grammars Průša D. Theoretical Computer Science 610, Part A, 121-132, 2016.  Type: Article All computer scientists should be familiar with the theory of one-dimensional strings including the automata that can recognize them and the grammars that generate them. But the two-dimensional version is terra incognita to many, and w... May 20 2016   On bounded languages and reversal-bounded automata Ibarra O., Ravikumar B. Information and Computation 24630-42, 2016.  Type: Article A language L is bounded context-free if it is accepted by a pushdown automaton (PDA) M with a bounded number of reversals; that is, there is a constant upper bound for the number of times ... May 2 2016   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 The modern theory of formal languages has progressed far beyond concepts such as regular expressions that the typical computer scientist is familiar with. One approach to language theory is based on the mathematical framework of profin... Mar 8 2016   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 It is well known that context-free languages (CFLs) can be recognized by pushdown automata. Such machines maintain a stack such that the top of the stack affects the state transitions. During the state transitions, the stack may get mo... Dec 7 2015   Language equivalence of probabilistic pushdown automata Forejt V., Jančar P., Kiefer S., Worrell J. Information and Computation 2371-11, 2014.  Type: Article A probabilistic pushdown automaton (PDA) maps a state and a letter on top of the pushdown stack to a probability distribution over states and stack actions (pushes and pops). Thus, it lies between a deterministic and a nondeterministic... Jan 26 2015   Regulated grammars and automata Meduna A., Zemek P., Springer Publishing Company, Incorporated, New York, NY, 2014. 690 pp.  Type: Book (978-1-493903-68-9) The Chomsky hierarchy, which is the stuff of classical computer science (CS) theory at the advanced undergraduate and beginning graduate levels, classifies formal grammars (and their associated formal languages) into four types: regula... Nov 25 2014   Formal languages and compilation (2nd ed.) Reghizzi S., Breveglieri L., Morzenti A., Springer Publishing Company, Incorporated, New York, NY, 2013. 451 pp.  Type: Book (978-1-447155-13-3) The relationships and equivalences between formal language categories and the different models of automata are among the deepest and most beautiful results in theoretical computer science. Given that the construction of programming lan... Oct 8 2014       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy