Direct or cascade product of pushdown automata

DOI10.1016/S0022-0000(77)80016-0zbMath0359.68054OpenAlexW1994801568MaRDI QIDQ1238631

Tadashi Ae

Publication date: 1977

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(77)80016-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items (5)

The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) ⋮ The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case ⋮ Some decision problems concerning sequential transducers and checking automata ⋮ More on the descriptional complexity of products of finite automata ⋮ On the descriptional complexity of the direct product of finite automata

Cites Work

• An infinite hierarchy of intersections of context-free languages
• A method of synthesis and decomposition of autonomous linear sequential circuits
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Direct or cascade product of pushdown automata