An LR Parser with Less States

2013 ◽  
Vol 310 ◽  
pp. 684-687
Author(s):  
Hong Jun Tang
Keyword(s):  
Finite Automata ◽  
Construction Method ◽  
Deterministic Finite Automata ◽  
Lr Parsing ◽  
New Construction

This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states. The new construction method has the same reorganization power as LALR parser but avoids the “reduce/reduce” conflict in LALR method. The experiment results show that the number of states in parsing table can be reduced greatly if the proposed method is used.

Numerical Analysis of Metro Station Construction by Large-Diameter Shield and Pile-Beam-Arch Method

2011 ◽  
Vol 368-373 ◽  
pp. 2711-2715 ◽  
Author(s):  
De Yun Ding ◽  
Xiu Ren Yang ◽  
Wei Dong Lu ◽  
Wei Ning Liu ◽  
Mei Yan ◽  
...  
Keyword(s):  
Ground Deformation ◽  
Large Diameter ◽  
Element Model ◽  
Construction Method ◽  
Shield Tunnel ◽  
Outer Diameter ◽  
Shield Tunneling ◽  
Metro Station ◽  
Dimensional Finite Element ◽  
New Construction

In more and more complicated urban building environment, a new construction method that metro engineering is constructed by large-diameter shield and shallow mining method can be regarded as a great attempt in China. By taking the Gaojiayuan station of Beijing metro line 14 as an engineering background, the main construction steps for the platform of the metro station built by a large-size shield with an outer diameter of 10 m and the Pile-Beam-Arch (PBA) method are introduced. Based on the soil-structure interaction theory, a two-dimensional finite element model is used to simulate the shield tunneling and the platform construction by the PBA method to enlarge the shield tunnel. The ground deformation and structural stress of the platform are predicted. The numerical results can be regarded as a valuable reference for the application of the new construction method in Beijing metro line 14.

Deterministic finite automata with recursive calls and DPDAs

2003 ◽  
Vol 87 (4) ◽  
pp. 187-193
Author(s):  
Jean H. Gallier ◽  
Salvatore La Torre ◽  
Supratik Mukhopadhyay
Keyword(s):  
Finite Automata ◽  
Deterministic Finite Automata

The detection and stabilisation of limit cycle for deterministic finite automata

2017 ◽  
Vol 91 (4) ◽  
pp. 874-886 ◽  
Author(s):  
Xiaoguang Han ◽  
Zengqiang Chen ◽  
Zhongxin Liu ◽  
Qing Zhang
Keyword(s):  
Limit Cycle ◽  
Finite Automata ◽  
Deterministic Finite Automata

Space-bounded OTMs and REG ∞

Computability ◽  
2021 ◽  
pp. 1-16
Author(s):  
Merlin Carl
Keyword(s):  
Complexity Theory ◽  
Turing Machine ◽  
Finite Automata ◽  
Regular Languages ◽  
The Other ◽  
Deterministic Finite Automata ◽  
Logarithmic Space ◽  
Working Space ◽  
Important Theorem

An important theorem in classical complexity theory is that REG = LOGLOGSPACE, i.e., that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce deterministic ordinal automata (DOAs) and show that they satisfy many of the basic statements of the theory of deterministic finite automata and regular languages. We then consider languages decidable by an ordinal Turing machine (OTM), introduced by P. Koepke in 2005 and show that if the working space of an OTM is of strictly smaller cardinality than the input length for all sufficiently long inputs, the language so decided is also decidable by a DOA, which is a transfinite analogue of LOGLOGSPACE ⊆ REG; the other direction, however, is easily seen to fail.

Sign in / Sign up

Export Citation Format

Share Document