Filters








218,158 Hits in 3.4 sec

Page 416 of Mathematical Reviews Vol. , Issue 91A [page]

1991 Mathematical Reviews  
For a class X, let X(b) denote the restricted class of machines of type X with the restriction that the language accepted is bounded.  ...  The goal is to show “separation” among these classes, where a class A is said to be “separated” from B (written (A, B)) if, for infinitely many n, there are machines of type B with n states whose minimal  ... 

Descriptional and Computational Complexity of Finite Automata [chapter]

Markus Holzer, Martin Kutrib
2009 Lecture Notes in Computer Science  
We thus come across descriptional and computational complexity issues of finite automata.  ...  Mostly, we discuss developments relevant to finite automata related problems like, for example, (i) simulation of and by several types of finite automata, (ii) standard automata problems such as, e.g.,  ...  A finite automaton is said to be minimal if its number of states is minimal with respect to the accepted language.  ... 
doi:10.1007/978-3-642-00982-2_3 fatcat:zacz7ijk2vajxkeqzlw25goe74

Recent Trends in Descriptional Complexity of Formal Languages

Martin Kutrib, Giovanni Pighizzini
2013 Bulletin of the European Association for Theoretical Computer Science  
This column presents a survey paper written by Martin Kutrib and myself, on some recent trends in descriptional complexity of formal languages.  ...  He proved that, for each d ≥ 2, the class of languages accepted by d-limited automata coincides with the class of context-free languages.  ...  In general, the family of all languages accepted by a device of some type X is denoted by L(X).  ... 
dblp:journals/eatcs/KutribPP13 fatcat:cnvr3fqe6bgsfhghh45uqtwysm

On two-way multihead automata

Oscar H. Ibarra
1973 Journal of computer and system sciences (Print)  
For each positive integer n, let -~eN(n ) be the class of sets accepted by a family of automata of type N, each with a read-only input with endmarkers and n two-way input heads.  ...  It is also shown that the class of sets accepted by deterministic (nondeterministic) two-way pushdown automata with n heads is properly included in the class of sets accepted by deterministic (nondeterministic  ...  with n heads is properly included in the class of sets accepted by such machines with Mn heads. The result now follows from Theorem I.  ... 
doi:10.1016/s0022-0000(73)80048-0 fatcat:46b4bqwoxbcolaqgiicy7vwwvm

Relating Hierarchy of Temporal Properties to Model Checking [chapter]

Ivana Černá, Radek Pelánek
2003 Lecture Notes in Computer Science  
For every possible combination of transition function and acceptance condition the class of specifiable properties exactly coincides with one class in the hierarchy.  ...  The complexity of the non-emptiness check depends on the type of the automaton.  ... 
doi:10.1007/978-3-540-45138-9_26 fatcat:zllmtn2c7rekzgtde7xj5z4l2m

On the recursion-theoretic complexity of relative succinctness of representations of languages

Louise Hay
1982 Information and Control  
Let C be a class of languages, with two types of repesentation ~.9~, 32.  ...  of k-element sets over the alphabet ~, 31 = the class of all Turing machines, ~2 = the class of finite automata (or tables) accepting exactly k elements of ~*.  ... 
doi:10.1016/s0019-9958(82)80081-8 fatcat:q5ongxuuzbagnppverwjq2wmam

Descriptional and computational complexity of finite automata—A survey

Markus Holzer, Martin Kutrib
2011 Information and Computation  
A finite automaton is said to be minimal if its number of states is minimal with respect to the accepted language.  ...  Mostly, we discuss developments relevant to finite automata related problems like, for example, (i) simulation of and by several types of finite automata, (ii) standard automata problems such as fixed  ...  Much work has been done in the study of descriptional complexity of simulation of and by several types of automata and on the computational complexity of decision problems related to finite automata.  ... 
doi:10.1016/j.ic.2010.11.013 fatcat:qisoh4k6snfuvbgowrj5bllsli

Page 2082 of Mathematical Reviews Vol. 53, Issue 6 [page]

1977 Mathematical Reviews  
As main results, a strong universal two-way pushdown automaton for the class of finite automata is con- structed and it is shown that there is no strong universal one-way pushdown automaton for this class  ...  It is shown that these concepts of universality are inappropriate for the class M of finite automata (in contrast to the case when M is the class of all Turing machines), since the computation of a universal  ... 

Page 2222 of Mathematical Reviews Vol. , Issue 91D [page]

1991 Mathematical Reviews  
Summary: “General recursive definitions in higher (finite) types, an alternative notation for finitely typed A-terms with if-then-else and fixpoints, can be classified into an infinite syntactic hierarchy  ...  The class of languages accepted by bounded error PPDA is not the same as that accepted by NPDA.  ... 

Probabilistic Type-2 Operators and "Almost"-Classes

R.V. Book, H. Vollmer, K.W. Wagner
1998 Computational Complexity  
This leads to a number of consequences about complexity classes of current interest.  ...  As applications, we obtain (a) a criterion for measure 1 inclusions of complexity classes, (b) a criterion for inclusions of complexity classes relative to a random oracle, (c) a new upper time bound for  ...  over finite words, when we deal with leaf language defined classes.  ... 
doi:10.1007/s000370050012 fatcat:rj3nsf3jxne4zjk5obdxtfh4um

Simulations of Quantum Finite Automata [chapter]

Gustaw Lippa, Krzysztof Makieła, Marcin Kuta
2020 Lecture Notes in Computer Science  
This paper presents a Python library to simulate different kinds of quantum finite automata on a classical computer.  ...  We have conducted experiments to measure the time complexity of the simulation in a function of the automaton size, alphabet size and word length. Examples of library usage are also provided.  ...  Acceptance with a cut-point and acceptance with an isolated cut-point are the most import modes of language acceptance, and are implemented in our library.  ... 
doi:10.1007/978-3-030-50433-5_34 fatcat:s3ji4xq7hzgbtpu2vhkp3duxue

Page 6612 of Mathematical Reviews Vol. , Issue 92m [page]

1992 Mathematical Reviews  
However, no general type 2 complexity theory has been de- 03 MATHEMATICAL LOGIC AND FOUNDATIONS 6612 veloped so far.  ...  It is shown that the finite classes and only they are identifiable in all computable numberings. If y and g are two numberings, y <ex g means EX, C EXg.  ... 

Formal Language Theory Meets Modern NLP [article]

William Merrill
2021 arXiv   pre-print
It also still holds true today, with a strand of recent works building formal analysis of modern neural networks methods in terms of formal languages.  ...  NLP is deeply intertwined with the formal study of language, both conceptually and historically. Arguably, this connection goes all the way back to Chomsky's Syntactic Structures in 1957.  ...  Acknowledgments This document heavily benefitted from discussions with Gail Weiss, Michael Hahn, Kyle Richardson, and my past and present advisors: Dana Angluin, Bob Frank, Yoav Goldberg, Noah Smith, and  ... 
arXiv:2102.10094v3 fatcat:r2szkmt5dzbkvnfnbiedzvvs6i

Analysing Complexity in Classes of Unary Automatic Structures [chapter]

Jiamou Liu, Mia Minnes
2009 Lecture Notes in Computer Science  
In addition, we study the state complexity of describing these classes. In particular, we focus on automatic equivalence relations, linear orders, trees, and graphs with finite degree.  ...  This paper addresses the complexity of several families of queries in classes of unary automatic structures. The queries include membership and isomorphism.  ...  The notion of state complexity measures the descriptive complexity of regular languages, context-free grammars, and other classes of languages with finite representations.  ... 
doi:10.1007/978-3-642-00982-2_44 fatcat:kr7ktxo4qjcg5nzk6r5fiepo7q

Page 6444 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
Fi- nally, we show that piecewise testable sets can be accepted with bounded error by a measure-many quantum finite automaton, in- troducing new construction techniques for quantum automata in the process  ...  Press, Los Alamitos, CA, 1997] can accept nonregular languages with bounded error in polynomial time.  ... 
« Previous Showing results 1 — 15 out of 218,158 results